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-158897699200553.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-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200553
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.1K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:45 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 156K 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-14-00
FORMULA_NAME BusinessProcesses-PT-14-01
FORMULA_NAME BusinessProcesses-PT-14-02
FORMULA_NAME BusinessProcesses-PT-14-03
FORMULA_NAME BusinessProcesses-PT-14-04
FORMULA_NAME BusinessProcesses-PT-14-05
FORMULA_NAME BusinessProcesses-PT-14-06
FORMULA_NAME BusinessProcesses-PT-14-07
FORMULA_NAME BusinessProcesses-PT-14-08
FORMULA_NAME BusinessProcesses-PT-14-09
FORMULA_NAME BusinessProcesses-PT-14-10
FORMULA_NAME BusinessProcesses-PT-14-11
FORMULA_NAME BusinessProcesses-PT-14-12
FORMULA_NAME BusinessProcesses-PT-14-13
FORMULA_NAME BusinessProcesses-PT-14-14
FORMULA_NAME BusinessProcesses-PT-14-15

=== Now, execution of the tool begins

BK_START 1589254687358

[2020-05-12 03:38:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 03:38:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:38:11] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2020-05-12 03:38:11] [INFO ] Transformed 624 places.
[2020-05-12 03:38:11] [INFO ] Transformed 564 transitions.
[2020-05-12 03:38:11] [INFO ] Found NUPN structural information;
[2020-05-12 03:38:11] [INFO ] Parsed PT model containing 624 places and 564 transitions in 191 ms.
Deduced a syphon composed of 8 places in 45 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 114 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 683 resets, run finished after 360 ms. (steps per millisecond=277 ) properties seen :[0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 556 rows 616 cols
[2020-05-12 03:38:12] [INFO ] Computed 99 place invariants in 51 ms
[2020-05-12 03:38:12] [INFO ] [Real]Absence check using 60 positive place invariants in 175 ms returned sat
[2020-05-12 03:38:12] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 20 ms returned sat
[2020-05-12 03:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:38:13] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2020-05-12 03:38:14] [INFO ] Deduced a trap composed of 14 places in 536 ms
[2020-05-12 03:38:15] [INFO ] Deduced a trap composed of 15 places in 642 ms
[2020-05-12 03:38:15] [INFO ] Deduced a trap composed of 19 places in 245 ms
[2020-05-12 03:38:15] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2020-05-12 03:38:16] [INFO ] Deduced a trap composed of 39 places in 312 ms
[2020-05-12 03:38:16] [INFO ] Deduced a trap composed of 33 places in 194 ms
[2020-05-12 03:38:16] [INFO ] Deduced a trap composed of 38 places in 368 ms
[2020-05-12 03:38:17] [INFO ] Deduced a trap composed of 123 places in 342 ms
[2020-05-12 03:38:17] [INFO ] Deduced a trap composed of 116 places in 192 ms
[2020-05-12 03:38:19] [INFO ] Deduced a trap composed of 117 places in 2129 ms
[2020-05-12 03:38:19] [INFO ] Deduced a trap composed of 120 places in 208 ms
[2020-05-12 03:38:20] [INFO ] Deduced a trap composed of 117 places in 835 ms
[2020-05-12 03:38:20] [INFO ] Deduced a trap composed of 39 places in 132 ms
[2020-05-12 03:38:20] [INFO ] Deduced a trap composed of 62 places in 87 ms
[2020-05-12 03:38:20] [INFO ] Deduced a trap composed of 44 places in 151 ms
[2020-05-12 03:38:21] [INFO ] Deduced a trap composed of 47 places in 109 ms
[2020-05-12 03:38:21] [INFO ] Deduced a trap composed of 45 places in 236 ms
[2020-05-12 03:38:21] [INFO ] Deduced a trap composed of 46 places in 382 ms
[2020-05-12 03:38:22] [INFO ] Deduced a trap composed of 22 places in 345 ms
[2020-05-12 03:38:22] [INFO ] Deduced a trap composed of 57 places in 176 ms
[2020-05-12 03:38:22] [INFO ] Deduced a trap composed of 25 places in 137 ms
[2020-05-12 03:38:22] [INFO ] Deduced a trap composed of 25 places in 138 ms
[2020-05-12 03:38:22] [INFO ] Deduced a trap composed of 22 places in 140 ms
[2020-05-12 03:38:23] [INFO ] Deduced a trap composed of 115 places in 148 ms
[2020-05-12 03:38:23] [INFO ] Deduced a trap composed of 145 places in 239 ms
[2020-05-12 03:38:23] [INFO ] Deduced a trap composed of 112 places in 360 ms
[2020-05-12 03:38:24] [INFO ] Deduced a trap composed of 23 places in 273 ms
[2020-05-12 03:38:24] [INFO ] Deduced a trap composed of 37 places in 270 ms
[2020-05-12 03:38:24] [INFO ] Deduced a trap composed of 122 places in 160 ms
[2020-05-12 03:38:24] [INFO ] Deduced a trap composed of 51 places in 369 ms
[2020-05-12 03:38:25] [INFO ] Deduced a trap composed of 138 places in 341 ms
[2020-05-12 03:38:25] [INFO ] Deduced a trap composed of 123 places in 132 ms
[2020-05-12 03:38:25] [INFO ] Deduced a trap composed of 141 places in 256 ms
[2020-05-12 03:38:26] [INFO ] Deduced a trap composed of 125 places in 271 ms
[2020-05-12 03:38:26] [INFO ] Deduced a trap composed of 121 places in 139 ms
[2020-05-12 03:38:26] [INFO ] Deduced a trap composed of 124 places in 158 ms
[2020-05-12 03:38:26] [INFO ] Deduced a trap composed of 24 places in 138 ms
[2020-05-12 03:38:26] [INFO ] Deduced a trap composed of 59 places in 248 ms
[2020-05-12 03:38:27] [INFO ] Deduced a trap composed of 57 places in 653 ms
[2020-05-12 03:38:27] [INFO ] Deduced a trap composed of 139 places in 331 ms
[2020-05-12 03:38:28] [INFO ] Deduced a trap composed of 112 places in 336 ms
[2020-05-12 03:38:28] [INFO ] Deduced a trap composed of 136 places in 177 ms
[2020-05-12 03:38:28] [INFO ] Deduced a trap composed of 58 places in 233 ms
[2020-05-12 03:38:28] [INFO ] Deduced a trap composed of 32 places in 128 ms
[2020-05-12 03:38:29] [INFO ] Deduced a trap composed of 116 places in 148 ms
[2020-05-12 03:38:29] [INFO ] Deduced a trap composed of 135 places in 147 ms
[2020-05-12 03:38:29] [INFO ] Deduced a trap composed of 57 places in 122 ms
[2020-05-12 03:38:29] [INFO ] Deduced a trap composed of 32 places in 129 ms
[2020-05-12 03:38:29] [INFO ] Deduced a trap composed of 50 places in 134 ms
[2020-05-12 03:38:29] [INFO ] Deduced a trap composed of 38 places in 129 ms
[2020-05-12 03:38:30] [INFO ] Deduced a trap composed of 124 places in 229 ms
[2020-05-12 03:38:30] [INFO ] Deduced a trap composed of 132 places in 130 ms
[2020-05-12 03:38:30] [INFO ] Deduced a trap composed of 34 places in 159 ms
[2020-05-12 03:38:30] [INFO ] Deduced a trap composed of 65 places in 182 ms
[2020-05-12 03:38:30] [INFO ] Deduced a trap composed of 66 places in 266 ms
[2020-05-12 03:38:31] [INFO ] Deduced a trap composed of 157 places in 152 ms
[2020-05-12 03:38:31] [INFO ] Deduced a trap composed of 143 places in 289 ms
[2020-05-12 03:38:31] [INFO ] Deduced a trap composed of 56 places in 372 ms
[2020-05-12 03:38:32] [INFO ] Deduced a trap composed of 63 places in 268 ms
[2020-05-12 03:38:32] [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 s2 s29 s30 s33 s34 s40 s41 s43 s44 s47 s48 s56 s57 s63 s64 s156 s157 s158 s216 s217 s218 s222 s223 s224 s234 s235 s236 s243 s246 s279 s280 s281 s285 s289 s293 s298 s303 s308 s313 s318 s323 s328 s333 s338 s343 s348 s418 s423 s428 s433 s480 s481 s484 s491 s492 s497 s498 s542 s543 s573 s574) 0)") while checking expression at index 0
[2020-05-12 03:38:32] [INFO ] [Real]Absence check using 60 positive place invariants in 44 ms returned sat
[2020-05-12 03:38:32] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 21 ms returned sat
[2020-05-12 03:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:38:33] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2020-05-12 03:38:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:38:33] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2020-05-12 03:38:33] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 19 ms returned sat
[2020-05-12 03:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:38:34] [INFO ] [Nat]Absence check using state equation in 1023 ms returned sat
[2020-05-12 03:38:34] [INFO ] Deduced a trap composed of 15 places in 246 ms
[2020-05-12 03:38:34] [INFO ] Deduced a trap composed of 22 places in 237 ms
[2020-05-12 03:38:35] [INFO ] Deduced a trap composed of 15 places in 236 ms
[2020-05-12 03:38:35] [INFO ] Deduced a trap composed of 14 places in 189 ms
[2020-05-12 03:38:35] [INFO ] Deduced a trap composed of 17 places in 181 ms
[2020-05-12 03:38:35] [INFO ] Deduced a trap composed of 16 places in 291 ms
[2020-05-12 03:38:36] [INFO ] Deduced a trap composed of 17 places in 265 ms
[2020-05-12 03:38:36] [INFO ] Deduced a trap composed of 23 places in 214 ms
[2020-05-12 03:38:36] [INFO ] Deduced a trap composed of 34 places in 153 ms
[2020-05-12 03:38:36] [INFO ] Deduced a trap composed of 30 places in 213 ms
[2020-05-12 03:38:37] [INFO ] Deduced a trap composed of 30 places in 368 ms
[2020-05-12 03:38:37] [INFO ] Deduced a trap composed of 21 places in 380 ms
[2020-05-12 03:38:37] [INFO ] Deduced a trap composed of 22 places in 207 ms
[2020-05-12 03:38:38] [INFO ] Deduced a trap composed of 29 places in 214 ms
[2020-05-12 03:38:38] [INFO ] Deduced a trap composed of 30 places in 578 ms
[2020-05-12 03:38:39] [INFO ] Deduced a trap composed of 32 places in 333 ms
[2020-05-12 03:38:39] [INFO ] Deduced a trap composed of 30 places in 182 ms
[2020-05-12 03:38:39] [INFO ] Deduced a trap composed of 37 places in 217 ms
[2020-05-12 03:38:39] [INFO ] Deduced a trap composed of 36 places in 153 ms
[2020-05-12 03:38:39] [INFO ] Deduced a trap composed of 31 places in 177 ms
[2020-05-12 03:38:40] [INFO ] Deduced a trap composed of 165 places in 151 ms
[2020-05-12 03:38:40] [INFO ] Deduced a trap composed of 22 places in 173 ms
[2020-05-12 03:38:40] [INFO ] Deduced a trap composed of 152 places in 155 ms
[2020-05-12 03:38:40] [INFO ] Deduced a trap composed of 20 places in 186 ms
[2020-05-12 03:38:40] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2020-05-12 03:38:41] [INFO ] Deduced a trap composed of 40 places in 233 ms
[2020-05-12 03:38:41] [INFO ] Deduced a trap composed of 154 places in 303 ms
[2020-05-12 03:38:41] [INFO ] Deduced a trap composed of 31 places in 172 ms
[2020-05-12 03:38:43] [INFO ] Deduced a trap composed of 41 places in 1529 ms
[2020-05-12 03:38:43] [INFO ] Deduced a trap composed of 50 places in 168 ms
[2020-05-12 03:38:43] [INFO ] Deduced a trap composed of 154 places in 169 ms
[2020-05-12 03:38:43] [INFO ] Deduced a trap composed of 42 places in 170 ms
[2020-05-12 03:38:44] [INFO ] Deduced a trap composed of 44 places in 275 ms
[2020-05-12 03:38:44] [INFO ] Deduced a trap composed of 18 places in 151 ms
[2020-05-12 03:38:44] [INFO ] Deduced a trap composed of 35 places in 257 ms
[2020-05-12 03:38:44] [INFO ] Deduced a trap composed of 154 places in 162 ms
[2020-05-12 03:38:45] [INFO ] Deduced a trap composed of 150 places in 446 ms
[2020-05-12 03:38:45] [INFO ] Deduced a trap composed of 155 places in 145 ms
[2020-05-12 03:38:46] [INFO ] Deduced a trap composed of 152 places in 678 ms
[2020-05-12 03:38:46] [INFO ] Deduced a trap composed of 20 places in 306 ms
[2020-05-12 03:38:47] [INFO ] Deduced a trap composed of 40 places in 208 ms
[2020-05-12 03:38:47] [INFO ] Deduced a trap composed of 114 places in 200 ms
[2020-05-12 03:38:47] [INFO ] Deduced a trap composed of 132 places in 241 ms
[2020-05-12 03:38:47] [INFO ] Deduced a trap composed of 134 places in 166 ms
[2020-05-12 03:38:48] [INFO ] Deduced a trap composed of 44 places in 394 ms
[2020-05-12 03:38:48] [INFO ] Deduced a trap composed of 52 places in 354 ms
[2020-05-12 03:38:48] [INFO ] Deduced a trap composed of 16 places in 241 ms
[2020-05-12 03:38:48] [INFO ] Deduced a trap composed of 38 places in 176 ms
[2020-05-12 03:38:49] [INFO ] Deduced a trap composed of 48 places in 496 ms
[2020-05-12 03:38:50] [INFO ] Deduced a trap composed of 145 places in 441 ms
[2020-05-12 03:38:50] [INFO ] Deduced a trap composed of 134 places in 465 ms
[2020-05-12 03:38:50] [INFO ] Deduced a trap composed of 143 places in 356 ms
[2020-05-12 03:38:51] [INFO ] Deduced a trap composed of 139 places in 246 ms
[2020-05-12 03:38:51] [INFO ] Deduced a trap composed of 145 places in 208 ms
[2020-05-12 03:38:51] [INFO ] Deduced a trap composed of 22 places in 244 ms
[2020-05-12 03:38:52] [INFO ] Deduced a trap composed of 129 places in 632 ms
[2020-05-12 03:38:52] [INFO ] Deduced a trap composed of 116 places in 397 ms
[2020-05-12 03:38:53] [INFO ] Deduced a trap composed of 132 places in 467 ms
[2020-05-12 03:38:53] [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 s2 s29 s30 s33 s47 s48 s56 s57 s77 s78 s150 s151 s152 s167 s169 s171 s173 s185 s186 s195 s201 s210 s216 s217 s218 s228 s229 s230 s243 s246 s280 s285 s293 s298 s307 s308 s309 s313 s323 s333 s348 s358 s363 s368 s373 s378 s383 s398 s408 s413 s417 s418 s419 s433 s437 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s465 s466 s467 s468 s469 s480 s481 s484 s485 s486 s491 s492 s499 s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s515 s516 s518 s519 s522 s523 s526 s527 s530 s531 s538 s539 s540 s541 s542 s543 s554 s555 s556 s557 s560 s561 s562 s563 s564 s567 s568 s569 s570 s571 s572 s575 s576 s577 s578 s581 s582) 0)") while checking expression at index 1
[2020-05-12 03:38:53] [INFO ] [Real]Absence check using 60 positive place invariants in 43 ms returned sat
[2020-05-12 03:38:53] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 25 ms returned sat
[2020-05-12 03:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:38:54] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2020-05-12 03:38:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:38:54] [INFO ] [Nat]Absence check using 60 positive place invariants in 48 ms returned sat
[2020-05-12 03:38:54] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 20 ms returned sat
[2020-05-12 03:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:38:55] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2020-05-12 03:38:55] [INFO ] Deduced a trap composed of 16 places in 180 ms
[2020-05-12 03:38:56] [INFO ] Deduced a trap composed of 22 places in 434 ms
[2020-05-12 03:38:56] [INFO ] Deduced a trap composed of 20 places in 334 ms
[2020-05-12 03:38:56] [INFO ] Deduced a trap composed of 23 places in 159 ms
[2020-05-12 03:38:57] [INFO ] Deduced a trap composed of 26 places in 279 ms
[2020-05-12 03:38:57] [INFO ] Deduced a trap composed of 46 places in 175 ms
[2020-05-12 03:38:57] [INFO ] Deduced a trap composed of 24 places in 184 ms
[2020-05-12 03:38:57] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2020-05-12 03:38:59] [INFO ] Deduced a trap composed of 22 places in 1194 ms
[2020-05-12 03:38:59] [INFO ] Deduced a trap composed of 19 places in 112 ms
[2020-05-12 03:38:59] [INFO ] Deduced a trap composed of 28 places in 113 ms
[2020-05-12 03:38:59] [INFO ] Deduced a trap composed of 32 places in 98 ms
[2020-05-12 03:38:59] [INFO ] Deduced a trap composed of 21 places in 89 ms
[2020-05-12 03:38:59] [INFO ] Deduced a trap composed of 23 places in 115 ms
[2020-05-12 03:38:59] [INFO ] Deduced a trap composed of 29 places in 175 ms
[2020-05-12 03:39:00] [INFO ] Deduced a trap composed of 31 places in 121 ms
[2020-05-12 03:39:00] [INFO ] Deduced a trap composed of 30 places in 178 ms
[2020-05-12 03:39:00] [INFO ] Deduced a trap composed of 36 places in 103 ms
[2020-05-12 03:39:00] [INFO ] Deduced a trap composed of 36 places in 131 ms
[2020-05-12 03:39:00] [INFO ] Deduced a trap composed of 54 places in 131 ms
[2020-05-12 03:39:01] [INFO ] Deduced a trap composed of 46 places in 274 ms
[2020-05-12 03:39:01] [INFO ] Deduced a trap composed of 50 places in 129 ms
[2020-05-12 03:39:01] [INFO ] Deduced a trap composed of 34 places in 403 ms
[2020-05-12 03:39:01] [INFO ] Deduced a trap composed of 37 places in 199 ms
[2020-05-12 03:39:02] [INFO ] Deduced a trap composed of 35 places in 174 ms
[2020-05-12 03:39:02] [INFO ] Deduced a trap composed of 26 places in 185 ms
[2020-05-12 03:39:02] [INFO ] Deduced a trap composed of 22 places in 226 ms
[2020-05-12 03:39:02] [INFO ] Deduced a trap composed of 55 places in 88 ms
[2020-05-12 03:39:02] [INFO ] Deduced a trap composed of 42 places in 137 ms
[2020-05-12 03:39:03] [INFO ] Deduced a trap composed of 48 places in 118 ms
[2020-05-12 03:39:03] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2020-05-12 03:39:03] [INFO ] Deduced a trap composed of 54 places in 151 ms
[2020-05-12 03:39:03] [INFO ] Deduced a trap composed of 49 places in 146 ms
[2020-05-12 03:39:03] [INFO ] Deduced a trap composed of 56 places in 124 ms
[2020-05-12 03:39:03] [INFO ] Deduced a trap composed of 34 places in 103 ms
[2020-05-12 03:39:03] [INFO ] Deduced a trap composed of 46 places in 152 ms
[2020-05-12 03:39:04] [INFO ] Deduced a trap composed of 52 places in 174 ms
[2020-05-12 03:39:04] [INFO ] Deduced a trap composed of 51 places in 198 ms
[2020-05-12 03:39:04] [INFO ] Deduced a trap composed of 53 places in 157 ms
[2020-05-12 03:39:04] [INFO ] Deduced a trap composed of 48 places in 158 ms
[2020-05-12 03:39:04] [INFO ] Deduced a trap composed of 32 places in 95 ms
[2020-05-12 03:39:05] [INFO ] Deduced a trap composed of 28 places in 115 ms
[2020-05-12 03:39:05] [INFO ] Deduced a trap composed of 36 places in 117 ms
[2020-05-12 03:39:05] [INFO ] Deduced a trap composed of 39 places in 87 ms
[2020-05-12 03:39:05] [INFO ] Deduced a trap composed of 38 places in 118 ms
[2020-05-12 03:39:05] [INFO ] Deduced a trap composed of 32 places in 93 ms
[2020-05-12 03:39:05] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-05-12 03:39:05] [INFO ] Deduced a trap composed of 30 places in 96 ms
[2020-05-12 03:39:05] [INFO ] Deduced a trap composed of 48 places in 112 ms
[2020-05-12 03:39:06] [INFO ] Deduced a trap composed of 52 places in 158 ms
[2020-05-12 03:39:06] [INFO ] Deduced a trap composed of 56 places in 100 ms
[2020-05-12 03:39:06] [INFO ] Deduced a trap composed of 19 places in 125 ms
[2020-05-12 03:39:06] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-05-12 03:39:06] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 10817 ms
[2020-05-12 03:39:06] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 51 ms.
[2020-05-12 03:39:09] [INFO ] Added : 304 causal constraints over 61 iterations in 3417 ms. Result :sat
[2020-05-12 03:39:10] [INFO ] [Real]Absence check using 60 positive place invariants in 404 ms returned sat
[2020-05-12 03:39:10] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 95 ms returned sat
[2020-05-12 03:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:11] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2020-05-12 03:39:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:39:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 35 ms returned unsat
[2020-05-12 03:39:11] [INFO ] [Real]Absence check using 60 positive place invariants in 34 ms returned sat
[2020-05-12 03:39:11] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 20 ms returned sat
[2020-05-12 03:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:12] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2020-05-12 03:39:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:39:12] [INFO ] [Nat]Absence check using 60 positive place invariants in 77 ms returned sat
[2020-05-12 03:39:12] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 17 ms returned sat
[2020-05-12 03:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:13] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2020-05-12 03:39:13] [INFO ] Deduced a trap composed of 19 places in 133 ms
[2020-05-12 03:39:13] [INFO ] Deduced a trap composed of 16 places in 137 ms
[2020-05-12 03:39:13] [INFO ] Deduced a trap composed of 19 places in 146 ms
[2020-05-12 03:39:13] [INFO ] Deduced a trap composed of 17 places in 147 ms
[2020-05-12 03:39:14] [INFO ] Deduced a trap composed of 19 places in 148 ms
[2020-05-12 03:39:14] [INFO ] Deduced a trap composed of 120 places in 133 ms
[2020-05-12 03:39:14] [INFO ] Deduced a trap composed of 14 places in 141 ms
[2020-05-12 03:39:14] [INFO ] Deduced a trap composed of 130 places in 170 ms
[2020-05-12 03:39:14] [INFO ] Deduced a trap composed of 28 places in 163 ms
[2020-05-12 03:39:15] [INFO ] Deduced a trap composed of 136 places in 151 ms
[2020-05-12 03:39:15] [INFO ] Deduced a trap composed of 27 places in 140 ms
[2020-05-12 03:39:15] [INFO ] Deduced a trap composed of 34 places in 139 ms
[2020-05-12 03:39:15] [INFO ] Deduced a trap composed of 37 places in 122 ms
[2020-05-12 03:39:15] [INFO ] Deduced a trap composed of 41 places in 110 ms
[2020-05-12 03:39:15] [INFO ] Deduced a trap composed of 42 places in 111 ms
[2020-05-12 03:39:15] [INFO ] Deduced a trap composed of 41 places in 112 ms
[2020-05-12 03:39:16] [INFO ] Deduced a trap composed of 31 places in 127 ms
[2020-05-12 03:39:16] [INFO ] Deduced a trap composed of 66 places in 151 ms
[2020-05-12 03:39:16] [INFO ] Deduced a trap composed of 68 places in 132 ms
[2020-05-12 03:39:16] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3104 ms
[2020-05-12 03:39:16] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 23 ms.
[2020-05-12 03:39:18] [INFO ] Added : 272 causal constraints over 55 iterations in 2352 ms. Result :sat
[2020-05-12 03:39:18] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2020-05-12 03:39:18] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 21 ms returned sat
[2020-05-12 03:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:19] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-05-12 03:39:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:39:19] [INFO ] [Nat]Absence check using 60 positive place invariants in 46 ms returned sat
[2020-05-12 03:39:19] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 19 ms returned sat
[2020-05-12 03:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:20] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2020-05-12 03:39:20] [INFO ] Deduced a trap composed of 16 places in 84 ms
[2020-05-12 03:39:20] [INFO ] Deduced a trap composed of 22 places in 85 ms
[2020-05-12 03:39:20] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2020-05-12 03:39:20] [INFO ] Deduced a trap composed of 76 places in 81 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 20 places in 75 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 32 places in 77 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 29 places in 74 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 29 places in 78 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 48 places in 80 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 53 places in 76 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 57 places in 86 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 42 places in 90 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 45 places in 71 ms
[2020-05-12 03:39:21] [INFO ] Deduced a trap composed of 45 places in 79 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 42 places in 73 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 50 places in 73 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 38 places in 79 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 43 places in 77 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 47 places in 69 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 45 places in 76 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 44 places in 79 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 52 places in 78 ms
[2020-05-12 03:39:22] [INFO ] Deduced a trap composed of 49 places in 74 ms
[2020-05-12 03:39:22] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2504 ms
[2020-05-12 03:39:23] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 25 ms.
[2020-05-12 03:39:25] [INFO ] Added : 265 causal constraints over 53 iterations in 2065 ms. Result :sat
[2020-05-12 03:39:25] [INFO ] Deduced a trap composed of 41 places in 61 ms
[2020-05-12 03:39:25] [INFO ] Deduced a trap composed of 39 places in 74 ms
[2020-05-12 03:39:25] [INFO ] Deduced a trap composed of 40 places in 77 ms
[2020-05-12 03:39:25] [INFO ] Deduced a trap composed of 38 places in 75 ms
[2020-05-12 03:39:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 524 ms
[2020-05-12 03:39:25] [INFO ] [Real]Absence check using 60 positive place invariants in 40 ms returned sat
[2020-05-12 03:39:25] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 32 ms returned sat
[2020-05-12 03:39:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:26] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2020-05-12 03:39:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:39:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned unsat
[2020-05-12 03:39:26] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2020-05-12 03:39:26] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 19 ms returned sat
[2020-05-12 03:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:27] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2020-05-12 03:39:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:39:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 202 ms returned sat
[2020-05-12 03:39:27] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 54 ms returned sat
[2020-05-12 03:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:30] [INFO ] [Nat]Absence check using state equation in 2702 ms returned sat
[2020-05-12 03:39:30] [INFO ] Deduced a trap composed of 19 places in 160 ms
[2020-05-12 03:39:31] [INFO ] Deduced a trap composed of 17 places in 148 ms
[2020-05-12 03:39:31] [INFO ] Deduced a trap composed of 18 places in 298 ms
[2020-05-12 03:39:31] [INFO ] Deduced a trap composed of 129 places in 374 ms
[2020-05-12 03:39:31] [INFO ] Deduced a trap composed of 16 places in 223 ms
[2020-05-12 03:39:32] [INFO ] Deduced a trap composed of 14 places in 320 ms
[2020-05-12 03:39:32] [INFO ] Deduced a trap composed of 18 places in 460 ms
[2020-05-12 03:39:33] [INFO ] Deduced a trap composed of 121 places in 265 ms
[2020-05-12 03:39:33] [INFO ] Deduced a trap composed of 36 places in 287 ms
[2020-05-12 03:39:33] [INFO ] Deduced a trap composed of 27 places in 395 ms
[2020-05-12 03:39:34] [INFO ] Deduced a trap composed of 23 places in 349 ms
[2020-05-12 03:39:34] [INFO ] Deduced a trap composed of 27 places in 173 ms
[2020-05-12 03:39:34] [INFO ] Deduced a trap composed of 36 places in 146 ms
[2020-05-12 03:39:34] [INFO ] Deduced a trap composed of 22 places in 195 ms
[2020-05-12 03:39:34] [INFO ] Deduced a trap composed of 122 places in 147 ms
[2020-05-12 03:39:35] [INFO ] Deduced a trap composed of 26 places in 154 ms
[2020-05-12 03:39:35] [INFO ] Deduced a trap composed of 37 places in 158 ms
[2020-05-12 03:39:35] [INFO ] Deduced a trap composed of 123 places in 175 ms
[2020-05-12 03:39:35] [INFO ] Deduced a trap composed of 40 places in 156 ms
[2020-05-12 03:39:35] [INFO ] Deduced a trap composed of 155 places in 140 ms
[2020-05-12 03:39:36] [INFO ] Deduced a trap composed of 150 places in 167 ms
[2020-05-12 03:39:36] [INFO ] Deduced a trap composed of 56 places in 143 ms
[2020-05-12 03:39:36] [INFO ] Deduced a trap composed of 149 places in 272 ms
[2020-05-12 03:39:36] [INFO ] Deduced a trap composed of 154 places in 218 ms
[2020-05-12 03:39:37] [INFO ] Deduced a trap composed of 148 places in 260 ms
[2020-05-12 03:39:37] [INFO ] Deduced a trap composed of 153 places in 257 ms
[2020-05-12 03:39:37] [INFO ] Deduced a trap composed of 148 places in 269 ms
[2020-05-12 03:39:37] [INFO ] Deduced a trap composed of 148 places in 309 ms
[2020-05-12 03:39:38] [INFO ] Deduced a trap composed of 36 places in 258 ms
[2020-05-12 03:39:38] [INFO ] Deduced a trap composed of 144 places in 358 ms
[2020-05-12 03:39:38] [INFO ] Deduced a trap composed of 147 places in 295 ms
[2020-05-12 03:39:39] [INFO ] Deduced a trap composed of 139 places in 270 ms
[2020-05-12 03:39:39] [INFO ] Deduced a trap composed of 145 places in 159 ms
[2020-05-12 03:39:39] [INFO ] Deduced a trap composed of 147 places in 150 ms
[2020-05-12 03:39:39] [INFO ] Deduced a trap composed of 152 places in 132 ms
[2020-05-12 03:39:40] [INFO ] Deduced a trap composed of 144 places in 250 ms
[2020-05-12 03:39:40] [INFO ] Deduced a trap composed of 146 places in 197 ms
[2020-05-12 03:39:40] [INFO ] Deduced a trap composed of 144 places in 134 ms
[2020-05-12 03:39:40] [INFO ] Deduced a trap composed of 146 places in 187 ms
[2020-05-12 03:39:40] [INFO ] Deduced a trap composed of 146 places in 208 ms
[2020-05-12 03:39:41] [INFO ] Deduced a trap composed of 143 places in 245 ms
[2020-05-12 03:39:41] [INFO ] Deduced a trap composed of 144 places in 190 ms
[2020-05-12 03:39:41] [INFO ] Deduced a trap composed of 149 places in 258 ms
[2020-05-12 03:39:41] [INFO ] Deduced a trap composed of 147 places in 206 ms
[2020-05-12 03:39:42] [INFO ] Deduced a trap composed of 154 places in 287 ms
[2020-05-12 03:39:42] [INFO ] Deduced a trap composed of 151 places in 283 ms
[2020-05-12 03:39:42] [INFO ] Deduced a trap composed of 144 places in 246 ms
[2020-05-12 03:39:43] [INFO ] Deduced a trap composed of 144 places in 149 ms
[2020-05-12 03:39:43] [INFO ] Deduced a trap composed of 148 places in 133 ms
[2020-05-12 03:39:43] [INFO ] Deduced a trap composed of 156 places in 145 ms
[2020-05-12 03:39:43] [INFO ] Deduced a trap composed of 145 places in 256 ms
[2020-05-12 03:39:43] [INFO ] Deduced a trap composed of 147 places in 145 ms
[2020-05-12 03:39:44] [INFO ] Deduced a trap composed of 153 places in 135 ms
[2020-05-12 03:39:44] [INFO ] Deduced a trap composed of 154 places in 170 ms
[2020-05-12 03:39:44] [INFO ] Deduced a trap composed of 155 places in 203 ms
[2020-05-12 03:39:44] [INFO ] Deduced a trap composed of 150 places in 412 ms
[2020-05-12 03:39:45] [INFO ] Deduced a trap composed of 155 places in 245 ms
[2020-05-12 03:39:45] [INFO ] Deduced a trap composed of 153 places in 170 ms
[2020-05-12 03:39:46] [INFO ] Deduced a trap composed of 149 places in 660 ms
[2020-05-12 03:39:46] [INFO ] Deduced a trap composed of 150 places in 420 ms
[2020-05-12 03:39:46] [INFO ] Deduced a trap composed of 148 places in 151 ms
[2020-05-12 03:39:46] [INFO ] Deduced a trap composed of 155 places in 152 ms
[2020-05-12 03:39:47] [INFO ] Deduced a trap composed of 153 places in 160 ms
[2020-05-12 03:39:47] [INFO ] Deduced a trap composed of 143 places in 268 ms
[2020-05-12 03:39:47] [INFO ] Deduced a trap composed of 153 places in 259 ms
[2020-05-12 03:39:47] [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 s2 s29 s30 s33 s40 s41 s56 s57 s77 s78 s121 s122 s123 s138 s139 s140 s144 s145 s146 s167 s173 s185 s186 s210 s243 s246 s280 s289 s298 s303 s308 s328 s343 s352 s354 s357 s358 s359 s363 s367 s369 s383 s387 s388 s389 s393 s398 s413 s418 s428 s433 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s456 s457 s458 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s480 s481 s482 s483 s484 s485 s486 s487 s488 s491 s492 s493 s494 s499 s500 s501 s502 s505 s506 s511 s512 s513 s514 s515 s516 s534 s535 s538 s539 s542 s543 s544 s546 s547 s548 s549 s550 s554 s555 s556 s557 s558 s559 s560 s561 s562 s563 s564 s565 s566 s569 s570 s571 s572 s573 s574 s577 s578 s581 s593 s594 s596 s597 s601 s602 s603 s604 s608 s609 s614 s615) 0)") while checking expression at index 7
[2020-05-12 03:39:47] [INFO ] [Real]Absence check using 60 positive place invariants in 34 ms returned sat
[2020-05-12 03:39:47] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 80 ms returned sat
[2020-05-12 03:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:48] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2020-05-12 03:39:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:39:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 54 ms returned sat
[2020-05-12 03:39:48] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2020-05-12 03:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:39:49] [INFO ] [Nat]Absence check using state equation in 940 ms returned sat
[2020-05-12 03:39:49] [INFO ] Deduced a trap composed of 19 places in 140 ms
[2020-05-12 03:39:50] [INFO ] Deduced a trap composed of 17 places in 145 ms
[2020-05-12 03:39:50] [INFO ] Deduced a trap composed of 18 places in 385 ms
[2020-05-12 03:39:50] [INFO ] Deduced a trap composed of 129 places in 321 ms
[2020-05-12 03:39:51] [INFO ] Deduced a trap composed of 16 places in 305 ms
[2020-05-12 03:39:51] [INFO ] Deduced a trap composed of 14 places in 301 ms
[2020-05-12 03:39:51] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-05-12 03:39:51] [INFO ] Deduced a trap composed of 121 places in 142 ms
[2020-05-12 03:39:52] [INFO ] Deduced a trap composed of 36 places in 155 ms
[2020-05-12 03:39:52] [INFO ] Deduced a trap composed of 27 places in 136 ms
[2020-05-12 03:39:52] [INFO ] Deduced a trap composed of 23 places in 151 ms
[2020-05-12 03:39:52] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2020-05-12 03:39:52] [INFO ] Deduced a trap composed of 36 places in 307 ms
[2020-05-12 03:39:53] [INFO ] Deduced a trap composed of 22 places in 151 ms
[2020-05-12 03:39:53] [INFO ] Deduced a trap composed of 122 places in 258 ms
[2020-05-12 03:39:53] [INFO ] Deduced a trap composed of 26 places in 174 ms
[2020-05-12 03:39:53] [INFO ] Deduced a trap composed of 37 places in 297 ms
[2020-05-12 03:39:54] [INFO ] Deduced a trap composed of 123 places in 271 ms
[2020-05-12 03:39:54] [INFO ] Deduced a trap composed of 40 places in 263 ms
[2020-05-12 03:39:54] [INFO ] Deduced a trap composed of 155 places in 260 ms
[2020-05-12 03:39:55] [INFO ] Deduced a trap composed of 150 places in 291 ms
[2020-05-12 03:39:55] [INFO ] Deduced a trap composed of 56 places in 274 ms
[2020-05-12 03:39:55] [INFO ] Deduced a trap composed of 149 places in 135 ms
[2020-05-12 03:39:55] [INFO ] Deduced a trap composed of 154 places in 132 ms
[2020-05-12 03:39:55] [INFO ] Deduced a trap composed of 148 places in 185 ms
[2020-05-12 03:39:56] [INFO ] Deduced a trap composed of 153 places in 364 ms
[2020-05-12 03:39:56] [INFO ] Deduced a trap composed of 148 places in 547 ms
[2020-05-12 03:39:57] [INFO ] Deduced a trap composed of 148 places in 116 ms
[2020-05-12 03:39:57] [INFO ] Deduced a trap composed of 36 places in 121 ms
[2020-05-12 03:39:57] [INFO ] Deduced a trap composed of 144 places in 122 ms
[2020-05-12 03:39:57] [INFO ] Deduced a trap composed of 147 places in 115 ms
[2020-05-12 03:39:57] [INFO ] Deduced a trap composed of 139 places in 118 ms
[2020-05-12 03:39:57] [INFO ] Deduced a trap composed of 145 places in 118 ms
[2020-05-12 03:39:57] [INFO ] Deduced a trap composed of 147 places in 117 ms
[2020-05-12 03:39:58] [INFO ] Deduced a trap composed of 152 places in 115 ms
[2020-05-12 03:39:58] [INFO ] Deduced a trap composed of 144 places in 119 ms
[2020-05-12 03:39:58] [INFO ] Deduced a trap composed of 146 places in 113 ms
[2020-05-12 03:39:58] [INFO ] Deduced a trap composed of 144 places in 116 ms
[2020-05-12 03:39:58] [INFO ] Deduced a trap composed of 146 places in 115 ms
[2020-05-12 03:39:58] [INFO ] Deduced a trap composed of 146 places in 121 ms
[2020-05-12 03:39:58] [INFO ] Deduced a trap composed of 143 places in 131 ms
[2020-05-12 03:39:59] [INFO ] Deduced a trap composed of 144 places in 147 ms
[2020-05-12 03:39:59] [INFO ] Deduced a trap composed of 149 places in 230 ms
[2020-05-12 03:39:59] [INFO ] Deduced a trap composed of 147 places in 255 ms
[2020-05-12 03:40:00] [INFO ] Deduced a trap composed of 154 places in 463 ms
[2020-05-12 03:40:00] [INFO ] Deduced a trap composed of 151 places in 381 ms
[2020-05-12 03:40:00] [INFO ] Deduced a trap composed of 144 places in 224 ms
[2020-05-12 03:40:00] [INFO ] Deduced a trap composed of 144 places in 168 ms
[2020-05-12 03:40:01] [INFO ] Deduced a trap composed of 148 places in 266 ms
[2020-05-12 03:40:01] [INFO ] Deduced a trap composed of 156 places in 242 ms
[2020-05-12 03:40:01] [INFO ] Deduced a trap composed of 145 places in 154 ms
[2020-05-12 03:40:02] [INFO ] Deduced a trap composed of 147 places in 297 ms
[2020-05-12 03:40:02] [INFO ] Deduced a trap composed of 153 places in 382 ms
[2020-05-12 03:40:02] [INFO ] Deduced a trap composed of 154 places in 253 ms
[2020-05-12 03:40:02] [INFO ] Deduced a trap composed of 155 places in 170 ms
[2020-05-12 03:40:03] [INFO ] Deduced a trap composed of 150 places in 209 ms
[2020-05-12 03:40:03] [INFO ] Deduced a trap composed of 155 places in 142 ms
[2020-05-12 03:40:03] [INFO ] Deduced a trap composed of 153 places in 218 ms
[2020-05-12 03:40:03] [INFO ] Deduced a trap composed of 149 places in 182 ms
[2020-05-12 03:40:04] [INFO ] Deduced a trap composed of 150 places in 145 ms
[2020-05-12 03:40:04] [INFO ] Deduced a trap composed of 148 places in 159 ms
[2020-05-12 03:40:04] [INFO ] Deduced a trap composed of 155 places in 145 ms
[2020-05-12 03:40:04] [INFO ] Deduced a trap composed of 153 places in 127 ms
[2020-05-12 03:40:04] [INFO ] Deduced a trap composed of 143 places in 144 ms
[2020-05-12 03:40:04] [INFO ] Deduced a trap composed of 153 places in 166 ms
[2020-05-12 03:40:05] [INFO ] Deduced a trap composed of 143 places in 136 ms
[2020-05-12 03:40:05] [INFO ] Deduced a trap composed of 139 places in 146 ms
[2020-05-12 03:40:05] [INFO ] Deduced a trap composed of 151 places in 162 ms
[2020-05-12 03:40:05] [INFO ] Deduced a trap composed of 152 places in 310 ms
[2020-05-12 03:40:06] [INFO ] Deduced a trap composed of 155 places in 675 ms
[2020-05-12 03:40:06] [INFO ] Deduced a trap composed of 147 places in 218 ms
[2020-05-12 03:40:06] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 16932 ms
[2020-05-12 03:40:06] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 24 ms.
[2020-05-12 03:40:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t224 0) (and (> t220 0) (< o220 o224)))") while checking expression at index 8
[2020-05-12 03:40:08] [INFO ] [Real]Absence check using 60 positive place invariants in 23 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-12 03:40:09] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-12 03:40:09] [INFO ] Flatten gal took : 163 ms
FORMULA BusinessProcesses-PT-14-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:40:09] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 03:40:09] [INFO ] Applying decomposition
[2020-05-12 03:40:09] [INFO ] Flatten gal took : 48 ms
[2020-05-12 03:40:09] [INFO ] Input system was already deterministic with 556 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/graph15740804514369477417.txt, -o, /tmp/graph15740804514369477417.bin, -w, /tmp/graph15740804514369477417.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/graph15740804514369477417.bin, -l, -1, -v, -w, /tmp/graph15740804514369477417.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 556 rows 616 cols
[2020-05-12 03:40:10] [INFO ] Decomposing Gal with order
[2020-05-12 03:40:10] [INFO ] Computed 99 place invariants in 32 ms
inv : p216 + p217 + p218 - p573 - p574 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p379 + p380 + p381 + p382 + p383 = 1
inv : p0 + p1 + p2 + p3 + p4 + p241 = 1
inv : p590 + p591 + p592 - p593 - p594 - p595 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p309 + p310 + p311 + p312 + p313 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p359 + p360 + p361 + p362 + p363 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p389 + p390 + p391 + p392 + p393 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p237 = 1
inv : p162 + p163 + p164 - p550 - p551 = 0
inv : p612 + p613 + p614 - p615 - p616 - p617 = 0
inv : p596 + p597 + p598 + p599 - p603 - p604 - p605 = 0
inv : p116 + p117 + p118 - p523 - p524 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p299 + p301 + p302 + p303 = 1
inv : p40 + p41 - p471 - p472 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p165 + p166 + p168 + p170 + p171 + p172 + p174 + p175 + p176 + p177 + p178 + p180 + p181 + p182 + p190 + p191 + p199 + p200 + p204 + p205 + p206 + p208 + p209 - 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 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p554 - p556 - p557 - p558 - p560 - p561 - p562 - p563 - p564 - p566 - p567 - p568 - p571 - p572 - p573 - p574 - p575 - p576 - p577 - p578 - p579 - p580 - p581 - p582 - p583 - p584 - p585 - p586 - p587 - p588 - p589 - p593 - p594 - p595 - p601 - p602 - p610 - p611 - p615 - p616 - p617 - p619 - p620 = 0
inv : p0 + p1 + p253 + p254 + p255 + p429 + p430 + p431 + p432 + p433 = 1
inv : p156 + p157 + p158 - p546 - p547 = 0
inv : p0 + 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 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p593 + p594 + p595 + p603 + p604 + p605 + p609 + p610 + p611 + p615 + p616 + p617 + p621 + p622 + p623 = 1
inv : p167 + p171 + p173 + p182 + p185 + p186 + p187 + p188 - p193 - p194 + p204 + p210 - p553 - p557 - p559 - p568 - p603 - p615 - p621 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p119 + p120 + p124 + p125 + p526 + p527 - p591 - p592 + p593 + p594 + p595 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 = 1
inv : p59 + p60 + p63 + p64 - p488 - p489 - p492 - p493 - p494 = 0
inv : p0 + p183 + p184 + 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 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p593 + p594 + p595 + p603 + p604 + p605 + p609 + p610 + p611 + p615 + p616 + p617 + p621 + p622 + p623 = 1
inv : p150 + p151 + p152 - p542 - p543 = 0
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 + p65 + p66 + p67 + p68 + p69 + p499 + p500 = 1
inv : p77 + p78 - p505 - p506 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p394 + p395 + p396 + p397 + p398 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p219 + p220 + p221 + p577 + p578 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p135 + p136 + p137 + p534 + p535 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p289 + p290 + p291 + p292 + p293 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p141 + p142 + p143 + p538 + p539 = 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 + p24 + p25 + p26 + p27 + p28 + p31 + p32 + p460 + p461 + p464 + p465 + p466 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p344 + p345 + p346 + p347 + p348 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p399 + p400 + p401 + p402 + p403 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p304 + p305 + p306 + p307 + p308 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p334 + p335 + p336 + p337 + p338 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p314 + p315 + p316 + p317 + p318 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p354 + p355 + p356 + p357 + p358 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p424 + p425 + p426 + p427 + p428 = 1
inv : p0 + p1 + p253 + p254 + p434 + p435 + p436 + p437 + p438 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p324 + p325 + p326 + p327 + p328 = 1
inv : p169 - p173 + p176 - p182 - p187 - p188 + p193 + p194 + p195 + p201 - p204 - p210 - p555 + p559 - p562 + p568 + p598 + p599 - p604 - p605 - p606 + p613 + p614 - p616 - p617 + p621 = 0
inv : p167 + p171 + p173 + p182 + p192 + p204 + p210 - p553 - p557 - p559 - p568 - p603 - p615 - p621 = 0
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 + p24 + p25 + p26 + p27 + p35 + p36 + p37 + p38 + p39 + p471 + p472 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p414 + p415 + p416 + p417 + p418 = 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 + p24 + p25 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p486 + p487 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p147 + p148 + p149 + p542 + p543 = 1
inv : p618 + p619 + p620 - p621 - p622 - p623 = 0
inv : p121 + p122 + p126 - p526 - p527 - p593 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p213 + p214 + p215 + p573 + p574 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p113 + p114 + p115 + p523 + p524 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p319 + p320 + p321 + p322 + p323 = 1
inv : p167 + p171 + p173 + p182 + p185 + p189 + p190 + p191 - p193 - p194 + p204 + p210 - p553 - p557 - p559 - p568 - p603 - p615 - p621 = 0
inv : p234 + p235 + p236 - p585 - p586 = 0
inv : p84 + p85 - p87 - p88 + p263 - p265 - p379 - p380 - p382 - p383 + p384 + p385 + p387 + p388 + p389 + p390 + p392 + p393 - p394 - p395 - p397 - p398 - p523 - p524 + p530 + p531 + p591 + p592 - p594 - p595 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p384 + p385 + p386 + p387 + p388 = 1
inv : p0 + p1 + p253 + p439 + p440 + p441 + p442 + p443 = 1
inv : p169 - p171 + p179 - p182 - p190 - p191 + p193 + p194 + p198 - p204 - p208 - p209 + p211 + p212 - p555 + p557 - p565 + p568 + p601 + p602 - p604 - p605 - p609 + p615 + p619 + p620 - p622 - p623 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p409 + p410 + p411 + p412 + p413 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p329 + p330 + p331 + p332 + p333 = 1
inv : p43 + p44 + p47 + p48 - p473 - p474 - p477 - p478 - p479 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p374 + p375 + p376 + p377 + p378 = 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 + p24 + p25 + p26 + p42 + p45 + p46 + p473 + p474 + p477 + p478 + p479 = 1
inv : p228 + p229 + p230 - p581 - p582 = 0
inv : p0 + p1 + p2 + p3 + p245 + p246 + p247 + p248 = 1
inv : p596 + p600 + p601 + p602 - p603 - p604 - p605 = 0
inv : p138 + p139 + p140 - p534 - p535 = 0
inv : p144 + p145 + p146 - p538 - p539 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p369 + p370 + p371 + p372 + p373 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p231 + p232 + p233 + p585 + p586 = 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 + p72 + p73 + p74 + p75 + p76 + p505 + p506 = 1
inv : p70 + p71 - p499 - p500 = 0
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p404 + p405 + p406 + p407 + p408 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p349 + p350 + p351 + p352 + p353 = 1
inv : -p169 + p173 - p176 + p182 + p187 + p188 - p193 - p194 + p196 + p197 - p198 - p199 - p200 - p201 + p204 + p210 + p555 - p559 + p562 - p568 - p598 - p599 + p604 + p605 + p606 - p613 - p614 + p616 + p617 - p621 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p153 + p154 + p155 + p546 + p547 = 1
inv : p606 + p607 + p608 - p609 - p610 - p611 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p119 + p120 + p127 + p128 + p526 + p527 + p593 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p79 + p80 + p81 + p82 + p83 + p87 + p88 - p263 + p265 + p379 + p380 + p382 + p383 - p384 - p385 - p387 - p388 - p389 - p390 - p392 - p393 + p394 + p395 + p397 + p398 + p523 + p524 - p530 - p531 - p591 - p592 + p594 + p595 = 1
inv : p222 + p223 + p224 - p577 - p578 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p159 + p160 + p161 + p550 + p551 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p419 + p420 + p421 + p422 + p423 = 1
inv : p0 + p1 + p2 + p249 + p250 + p251 + p252 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p79 + p80 + p81 + p82 + p86 + p87 + p88 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p294 + p296 + p297 + p298 = 1
inv : p56 + p57 - p486 - p487 = 0
inv : p29 + p30 + p33 + p34 - p460 - p461 - p464 - p465 - p466 = 0
inv : p110 + p111 + p112 - p519 - p520 = 0
inv : p132 + p133 + p134 - p530 - p531 = 0
inv : p121 + p122 + p123 - p526 - p527 + p591 + p592 - p593 - p594 - p595 = 0
inv : p207 + p208 + p209 - p210 - p211 - p212 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p165 + p166 + p168 + p170 + p171 + p172 + p174 + p175 + p176 + p177 + p178 + p180 + p181 + p182 + p190 + p191 + p199 + p200 + p201 + p202 + p203 + p208 + p209 - 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 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p522 - p523 - p524 - p525 - p526 - p527 - p528 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p537 - p538 - p539 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p554 - p556 - p557 - p558 - p560 - p561 - p562 - p563 - p564 - p566 - p567 - p568 - p571 - p572 - p573 - p574 - p575 - p576 - p577 - p578 - p579 - p580 - p581 - p582 - p583 - p584 - p585 - p586 - p587 - p588 - p589 - p593 - p594 - p595 - p601 - p602 - p610 - p611 - p615 - p616 - p617 - p619 - p620 = 0
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 + p24 + p58 + p61 + p62 + p488 + p489 + p492 + p493 + p494 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p225 + p226 + p227 + p581 + p582 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p129 + p130 + p131 + p530 + p531 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p339 + p340 + p341 + p342 + p343 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p107 + p108 + p109 + p519 + p520 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p364 + p365 + p366 + p367 + p368 = 1
Total of 99 invariants.
[2020-05-12 03:40:10] [INFO ] Computed 99 place invariants in 35 ms
[2020-05-12 03:40:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:40:10] [INFO ] Removed a total of 278 redundant transitions.
[2020-05-12 03:40:10] [INFO ] Flatten gal took : 156 ms
[2020-05-12 03:40:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 14 ms.
[2020-05-12 03:40:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 34 ms
[2020-05-12 03:40:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 7 LTL properties
Checking formula 0 : !((F(G(F(X(F("((i15.i5.u149.p386==0)||(i18.i1.u247.p559==1))")))))))
Formula 0 simplified : !FGFXF"((i15.i5.u149.p386==0)||(i18.i1.u247.p559==1))"
built 70 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 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 26 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 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 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 22 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 78 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 4 ordering constraints for composite.
built 27 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 20 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 22 ordering constraints for composite.
built 75 ordering constraints for composite.
built 37 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 21 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-12 03:40:11] [INFO ] Proved 616 variables to be positive in 1279 ms
[2020-05-12 03:40:11] [INFO ] Computing symmetric may disable matrix : 556 transitions.
[2020-05-12 03:40:11] [INFO ] Computation of disable matrix completed :0/556 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:40:11] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:40:11] [INFO ] Computing symmetric may enable matrix : 556 transitions.
[2020-05-12 03:40:11] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 03:40:11] [INFO ] Computing symmetric co enabling matrix : 556 transitions.
[2020-05-12 03:40:14] [INFO ] Computation of co-enabling matrix(3/556) took 2862 ms. Total solver calls (SAT/UNSAT): 616(562/54)
[2020-05-12 03:40:17] [INFO ] Computation of co-enabling matrix(7/556) took 5985 ms. Total solver calls (SAT/UNSAT): 1690(1166/524)
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-12 03:40:21] [INFO ] Computation of co-enabling matrix(8/556) took 9354 ms. Total solver calls (SAT/UNSAT): 1826(1170/656)
[2020-05-12 03:40:21] [INFO ] Computation of Finished co-enabling matrix. took 9377 ms. Total solver calls (SAT/UNSAT): 1826(1170/656)
[2020-05-12 03:40:21] [INFO ] Computing Do-Not-Accords matrix : 556 transitions.
[2020-05-12 03:40:25] [INFO ] Computation of Completed DNA matrix. took 3684 ms. Total solver calls (SAT/UNSAT): 3488(0/3488)
[2020-05-12 03:40:25] [INFO ] Built C files in 15690ms 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 5571 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 55 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([](<>(X(<>((LTLAP0==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)))))), --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)))))), --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)
Reverse transition relation is NOT exact ! Due to transitions t31, t286, t408, t422, i0.i0.u59.t339, i0.i0.u61.t335, i0.i0.u63.t331, i0.i1.t166, i0.i1.u163.t167, i1.u53.t351, i1.u55.t347, i1.u57.t343, i2.t413, i2.t411, i2.u19.t415, i3.i0.t402, i3.i0.t416, i3.i0.u11.t430, i3.i0.u17.t419, i3.i0.u24.t405, i3.i1.t421, i3.i1.u18.t417, i3.i2.t407, i3.i2.u25.t403, i3.i3.t389, i4.t370, i4.i0.t368, i4.i0.t383, i4.i1.t373, i4.i1.t375, i4.i1.t377, i4.i1.t379, i5.i0.u86.t297, i5.i1.t234, i5.i1.u128.t235, i5.i2.t230, i5.i2.u131.t231, i6.i0.u90.t289, i6.i0.u93.t279, i6.i2.t154, i6.i2.u168.t155, i6.i3.t150, i6.i3.u171.t151, i7.i1.t238, i7.i1.u126.t239, i7.i2.t226, i7.i2.u133.t227, i7.i3.t222, i7.i3.u135.t223, i7.i4.t218, i7.i4.u137.t219, i7.i5.t214, i7.i5.u138.t215, i8.i0.t432, i8.i0.u12.t428, i8.i2.t273, i8.i2.u111.t274, i8.i3.t270, i8.i3.u112.t271, i9.i0.t399, i9.i0.u26.t401, i9.i1.t258, i9.i1.u117.t259, i9.i2.t254, i9.i2.u119.t255, i10.t425, i10.u13.t427, i11.i0.t250, i11.i0.u121.t251, i11.i1.t246, i11.i1.u123.t247, i11.i2.t242, i11.i2.u124.t243, i12.t102, i12.u191.t106, i13.t290, i13.u84.t301, i13.u88.t293, i14.i0.t393, i14.i0.u29.t395, i14.i1.t162, i14.i1.u164.t163, i14.i2.t158, i14.i2.u166.t159, i15.i1.t210, i15.i1.u141.t211, i15.i2.t206, i15.i2.u143.t207, i15.i3.t202, i15.i3.u144.t203, i15.i4.t198, i15.i4.u146.t199, i15.i5.t194, i15.i5.u149.t195, i16.i0.u45.t365, i16.i0.u47.t361, i16.i1.t190, i16.i1.u151.t191, i17.i0.u49.t357, i17.i1.t186, i17.i1.u152.t187, i17.i2.t182, i17.i2.u155.t183, i18.t305, i18.i0.t174, i18.i0.t178, i18.i0.t307, i18.i0.t309, i18.i0.u65.t313, i18.i0.u65.t317, i18.i0.u65.t321, i18.i0.u65.t327, i18.i0.u157.t179, i18.i0.u158.t175, i18.i1.t170, i18.i1.u161.t171, i19.t126, i19.u178.t130, i20.t144, i20.t137, i20.t128, i20.t124, i20.t122, i20.t117, i20.t113, i20.t111, i20.t109, i20.t104, i20.t100, i20.t98, i20.t95, i20.t93, i20.t90, i20.t88, i20.t86, i20.t84, i20.t82, i20.t80, i20.t77, i20.t69, i20.t66, i20.t63, i20.t60, i20.t57, i20.t54, i20.t26, i20.t23, i20.t20, i20.t17, i20.t14, i20.u177.t12, i20.u177.t37, i20.u177.t41, i20.u177.t45, i20.u177.t51, i20.u177.t74, i20.u177.t132, i21.t115, i21.u184.t119, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/359/159/554
Computing Next relation with stutter on 1206 deadlock states
135 unique states visited
135 strongly connected components in search stack
136 transitions explored
135 items max in DFS search stack
43167 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,431.727,3666456,1,0,5.17751e+06,912,4569,1.13276e+07,231,2829,6149484
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-14-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G("((i18.i0.u222.p555!=0)&&(i2.u19.p49!=1))"))))
Formula 1 simplified : !XG"((i18.i0.u222.p555!=0)&&(i2.u19.p49!=1))"
Computing Next relation with stutter on 1206 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13303 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,564.756,3855108,1,0,5.65849e+06,929,5245,1.38046e+07,251,2829,6900947
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-14-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((("((i15.i0.u103.p268==0)||(i3.i0.u17.p42==1))")U(F(G(F(G(F("((i13.u228.p573==0)||(i10.u14.p38==1))")))))))||(X(F("((i13.u228.p573==0)||(i10.u14.p38==1))")))))
Formula 2 simplified : !(("((i15.i0.u103.p268==0)||(i3.i0.u17.p42==1))" U FGFGF"((i13.u228.p573==0)||(i10.u14.p38==1))") | XF"((i13.u228.p573==0)||(i10.u14.p38==1))")
Computing Next relation with stutter on 1206 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,564.759,3856044,1,0,5.65849e+06,929,5269,1.38046e+07,252,2829,6900979
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-14-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X(G("((i8.i3.u113.p293==0)||(i13.u85.p218==1))")))))
Formula 3 simplified : XG"((i8.i3.u113.p293==0)||(i13.u85.p218==1))"
Computing Next relation with stutter on 1206 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7112 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,635.877,4469052,1,0,6.49713e+06,931,4443,1.57782e+07,231,2829,1139131
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-14-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(X(G(F("((i0.i0.u3.p11==0)||(i13.u2.p9==1))")))))))
Formula 4 simplified : !GXGF"((i0.i0.u3.p11==0)||(i13.u2.p9==1))"
Computing Next relation with stutter on 1206 deadlock states
135 unique states visited
135 strongly connected components in search stack
136 transitions explored
135 items max in DFS search stack
14790 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,783.793,4469052,1,0,6.49713e+06,933,5284,1.57782e+07,251,2829,4018163
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-14-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((G(("((i17.i0.u50.p126==0)||(i20.u220.p549==1))")U(G("((i17.i0.u50.p126!=0)&&(i20.u220.p549!=1))"))))&&(F("((i9.i0.u28.p71!=0)&&(i6.i1.u97.p254!=1))")))))
Formula 5 simplified : !X(G("((i17.i0.u50.p126==0)||(i20.u220.p549==1))" U G"((i17.i0.u50.p126!=0)&&(i20.u220.p549!=1))") & F"((i9.i0.u28.p71!=0)&&(i6.i1.u97.p254!=1))")
Computing Next relation with stutter on 1206 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
11085 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,894.648,4819812,1,0,7.28102e+06,1011,5393,1.64803e+07,256,3193,12424125
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-14-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(!(G("((i2.u22.p56==0)||(i8.i0.u12.p33==1))")))))
Formula 6 simplified : !F!G"((i2.u22.p56==0)||(i8.i0.u12.p33==1))"
Computing Next relation with stutter on 1206 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
36 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,895.014,4832484,1,0,7.31359e+06,1011,5465,1.64999e+07,256,3193,12502969
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-14-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589255743947

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-14"
export BK_EXAMINATION="LTLCardinality"
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-14, examination is LTLCardinality"
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-158897699200553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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