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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 3.2K 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.1K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.1K Apr 8 14:44 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 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 25 17:48 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 157K 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-15-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589255536419

[2020-05-12 03:52:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:52:18] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-05-12 03:52:18] [INFO ] Transformed 630 places.
[2020-05-12 03:52:18] [INFO ] Transformed 566 transitions.
[2020-05-12 03:52:18] [INFO ] Found NUPN structural information;
[2020-05-12 03:52:18] [INFO ] Parsed PT model containing 630 places and 566 transitions in 107 ms.
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Incomplete random walk after 100000 steps, including 676 resets, run finished after 228 ms. (steps per millisecond=438 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0]
// Phase 1: matrix 562 rows 626 cols
[2020-05-12 03:52:18] [INFO ] Computed 102 place invariants in 22 ms
[2020-05-12 03:52:18] [INFO ] [Real]Absence check using 61 positive place invariants in 73 ms returned sat
[2020-05-12 03:52:18] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 28 ms returned sat
[2020-05-12 03:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:52:19] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2020-05-12 03:52:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:52:20] [INFO ] [Nat]Absence check using 61 positive place invariants in 70 ms returned sat
[2020-05-12 03:52:20] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 28 ms returned sat
[2020-05-12 03:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:52:20] [INFO ] [Nat]Absence check using state equation in 534 ms returned unsat
[2020-05-12 03:52:20] [INFO ] [Real]Absence check using 61 positive place invariants in 63 ms returned sat
[2020-05-12 03:52:20] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 27 ms returned sat
[2020-05-12 03:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:52:21] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2020-05-12 03:52:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:52:21] [INFO ] [Nat]Absence check using 61 positive place invariants in 43 ms returned sat
[2020-05-12 03:52:21] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:52:22] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2020-05-12 03:52:23] [INFO ] Deduced a trap composed of 18 places in 506 ms
[2020-05-12 03:52:23] [INFO ] Deduced a trap composed of 12 places in 501 ms
[2020-05-12 03:52:24] [INFO ] Deduced a trap composed of 26 places in 212 ms
[2020-05-12 03:52:24] [INFO ] Deduced a trap composed of 128 places in 207 ms
[2020-05-12 03:52:24] [INFO ] Deduced a trap composed of 12 places in 187 ms
[2020-05-12 03:52:24] [INFO ] Deduced a trap composed of 141 places in 222 ms
[2020-05-12 03:52:24] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2020-05-12 03:52:25] [INFO ] Deduced a trap composed of 132 places in 452 ms
[2020-05-12 03:52:25] [INFO ] Deduced a trap composed of 34 places in 221 ms
[2020-05-12 03:52:25] [INFO ] Deduced a trap composed of 17 places in 199 ms
[2020-05-12 03:52:26] [INFO ] Deduced a trap composed of 20 places in 169 ms
[2020-05-12 03:52:26] [INFO ] Deduced a trap composed of 22 places in 186 ms
[2020-05-12 03:52:26] [INFO ] Deduced a trap composed of 24 places in 213 ms
[2020-05-12 03:52:26] [INFO ] Deduced a trap composed of 125 places in 189 ms
[2020-05-12 03:52:27] [INFO ] Deduced a trap composed of 22 places in 185 ms
[2020-05-12 03:52:27] [INFO ] Deduced a trap composed of 23 places in 188 ms
[2020-05-12 03:52:27] [INFO ] Deduced a trap composed of 30 places in 203 ms
[2020-05-12 03:52:27] [INFO ] Deduced a trap composed of 31 places in 182 ms
[2020-05-12 03:52:28] [INFO ] Deduced a trap composed of 36 places in 227 ms
[2020-05-12 03:52:28] [INFO ] Deduced a trap composed of 28 places in 185 ms
[2020-05-12 03:52:28] [INFO ] Deduced a trap composed of 137 places in 178 ms
[2020-05-12 03:52:28] [INFO ] Deduced a trap composed of 138 places in 180 ms
[2020-05-12 03:52:28] [INFO ] Deduced a trap composed of 38 places in 138 ms
[2020-05-12 03:52:29] [INFO ] Deduced a trap composed of 36 places in 140 ms
[2020-05-12 03:52:29] [INFO ] Deduced a trap composed of 19 places in 200 ms
[2020-05-12 03:52:29] [INFO ] Deduced a trap composed of 33 places in 205 ms
[2020-05-12 03:52:29] [INFO ] Deduced a trap composed of 27 places in 176 ms
[2020-05-12 03:52:29] [INFO ] Deduced a trap composed of 27 places in 182 ms
[2020-05-12 03:52:30] [INFO ] Deduced a trap composed of 136 places in 183 ms
[2020-05-12 03:52:30] [INFO ] Deduced a trap composed of 121 places in 211 ms
[2020-05-12 03:52:30] [INFO ] Deduced a trap composed of 26 places in 178 ms
[2020-05-12 03:52:30] [INFO ] Deduced a trap composed of 35 places in 308 ms
[2020-05-12 03:52:31] [INFO ] Deduced a trap composed of 24 places in 417 ms
[2020-05-12 03:52:31] [INFO ] Deduced a trap composed of 15 places in 392 ms
[2020-05-12 03:52:32] [INFO ] Deduced a trap composed of 24 places in 384 ms
[2020-05-12 03:52:32] [INFO ] Deduced a trap composed of 142 places in 189 ms
[2020-05-12 03:52:32] [INFO ] Deduced a trap composed of 29 places in 214 ms
[2020-05-12 03:52:32] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-05-12 03:52:33] [INFO ] Deduced a trap composed of 23 places in 196 ms
[2020-05-12 03:52:33] [INFO ] Deduced a trap composed of 47 places in 182 ms
[2020-05-12 03:52:33] [INFO ] Deduced a trap composed of 130 places in 296 ms
[2020-05-12 03:52:40] [INFO ] Deduced a trap composed of 48 places in 6446 ms
[2020-05-12 03:52:40] [INFO ] Deduced a trap composed of 40 places in 326 ms
[2020-05-12 03:52:40] [INFO ] Deduced a trap composed of 135 places in 332 ms
[2020-05-12 03:52:41] [INFO ] Deduced a trap composed of 25 places in 337 ms
[2020-05-12 03:52:41] [INFO ] Deduced a trap composed of 113 places in 341 ms
[2020-05-12 03:52:41] [INFO ] Deduced a trap composed of 44 places in 287 ms
[2020-05-12 03:52:41] [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 s29 s32 s33 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s291 s294 s295 s461 s462 s465 s466 s467) 0)") while checking expression at index 1
[2020-05-12 03:52:42] [INFO ] [Real]Absence check using 61 positive place invariants in 43 ms returned sat
[2020-05-12 03:52:42] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2020-05-12 03:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:52:42] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2020-05-12 03:52:43] [INFO ] Deduced a trap composed of 23 places in 209 ms
[2020-05-12 03:52:43] [INFO ] Deduced a trap composed of 11 places in 487 ms
[2020-05-12 03:52:43] [INFO ] Deduced a trap composed of 21 places in 225 ms
[2020-05-12 03:52:44] [INFO ] Deduced a trap composed of 31 places in 191 ms
[2020-05-12 03:52:44] [INFO ] Deduced a trap composed of 36 places in 193 ms
[2020-05-12 03:52:44] [INFO ] Deduced a trap composed of 117 places in 191 ms
[2020-05-12 03:52:44] [INFO ] Deduced a trap composed of 18 places in 132 ms
[2020-05-12 03:52:44] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2020-05-12 03:52:45] [INFO ] Deduced a trap composed of 25 places in 155 ms
[2020-05-12 03:52:45] [INFO ] Deduced a trap composed of 18 places in 177 ms
[2020-05-12 03:52:47] [INFO ] Deduced a trap composed of 126 places in 1851 ms
[2020-05-12 03:52:47] [INFO ] Deduced a trap composed of 29 places in 202 ms
[2020-05-12 03:52:47] [INFO ] Deduced a trap composed of 25 places in 199 ms
[2020-05-12 03:52:47] [INFO ] Deduced a trap composed of 26 places in 209 ms
[2020-05-12 03:52:48] [INFO ] Deduced a trap composed of 118 places in 203 ms
[2020-05-12 03:52:51] [INFO ] Deduced a trap composed of 32 places in 3230 ms
[2020-05-12 03:52:52] [INFO ] Deduced a trap composed of 38 places in 538 ms
[2020-05-12 03:52:52] [INFO ] Deduced a trap composed of 23 places in 290 ms
[2020-05-12 03:52:52] [INFO ] Deduced a trap composed of 120 places in 369 ms
[2020-05-12 03:52:53] [INFO ] Deduced a trap composed of 116 places in 367 ms
[2020-05-12 03:52:53] [INFO ] Deduced a trap composed of 40 places in 335 ms
[2020-05-12 03:52:53] [INFO ] Deduced a trap composed of 112 places in 381 ms
[2020-05-12 03:52:54] [INFO ] Deduced a trap composed of 22 places in 591 ms
[2020-05-12 03:52:54] [INFO ] Deduced a trap composed of 117 places in 171 ms
[2020-05-12 03:52:55] [INFO ] Deduced a trap composed of 135 places in 291 ms
[2020-05-12 03:52:55] [INFO ] Deduced a trap composed of 28 places in 332 ms
[2020-05-12 03:52:56] [INFO ] Deduced a trap composed of 122 places in 496 ms
[2020-05-12 03:52:56] [INFO ] Deduced a trap composed of 133 places in 239 ms
[2020-05-12 03:52:56] [INFO ] Deduced a trap composed of 121 places in 281 ms
[2020-05-12 03:52:57] [INFO ] Deduced a trap composed of 29 places in 397 ms
[2020-05-12 03:52:57] [INFO ] Deduced a trap composed of 123 places in 374 ms
[2020-05-12 03:52:58] [INFO ] Deduced a trap composed of 120 places in 483 ms
[2020-05-12 03:52:58] [INFO ] Deduced a trap composed of 120 places in 450 ms
[2020-05-12 03:52:58] [INFO ] Deduced a trap composed of 38 places in 175 ms
[2020-05-12 03:52:59] [INFO ] Deduced a trap composed of 154 places in 321 ms
[2020-05-12 03:52:59] [INFO ] Deduced a trap composed of 45 places in 341 ms
[2020-05-12 03:52:59] [INFO ] Deduced a trap composed of 126 places in 305 ms
[2020-05-12 03:53:00] [INFO ] Deduced a trap composed of 125 places in 343 ms
[2020-05-12 03:53:00] [INFO ] Deduced a trap composed of 27 places in 343 ms
[2020-05-12 03:53:00] [INFO ] Deduced a trap composed of 130 places in 297 ms
[2020-05-12 03:53:01] [INFO ] Deduced a trap composed of 45 places in 322 ms
[2020-05-12 03:53:01] [INFO ] Deduced a trap composed of 142 places in 266 ms
[2020-05-12 03:53:01] [INFO ] Deduced a trap composed of 126 places in 244 ms
[2020-05-12 03:53:02] [INFO ] Deduced a trap composed of 117 places in 134 ms
[2020-05-12 03:53:02] [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 s30 s31 s34 s35 s36 s37 s38 s50 s51 s54 s143 s144 s145 s224 s225 s226 s243 s244 s245 s288 s293 s303 s307 s309 s331 s333 s342 s361 s363 s367 s372 s381 s383 s386 s387 s388 s402 s412 s417 s422 s432 s437 s442 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s470 s471 s472 s473 s480 s481 s482 s483 s484 s489 s490 s491 s492 s493 s494 s495 s496 s497 s498 s501 s502 s522 s523 s526 s527 s528 s529 s534 s535 s542 s543 s546 s547 s548 s549 s550 s551 s554 s555 s557 s558 s561 s562 s565 s566 s567 s568 s569 s570 s577 s578 s579 s580 s583 s584 s591 s623) 0)") while checking expression at index 2
[2020-05-12 03:53:02] [INFO ] [Real]Absence check using 61 positive place invariants in 62 ms returned sat
[2020-05-12 03:53:02] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 44 ms returned sat
[2020-05-12 03:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:04] [INFO ] [Real]Absence check using state equation in 1740 ms returned sat
[2020-05-12 03:53:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:53:04] [INFO ] [Nat]Absence check using 61 positive place invariants in 237 ms returned sat
[2020-05-12 03:53:04] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 52 ms returned sat
[2020-05-12 03:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:05] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2020-05-12 03:53:05] [INFO ] Deduced a trap composed of 13 places in 225 ms
[2020-05-12 03:53:06] [INFO ] Deduced a trap composed of 15 places in 348 ms
[2020-05-12 03:53:06] [INFO ] Deduced a trap composed of 16 places in 248 ms
[2020-05-12 03:53:06] [INFO ] Deduced a trap composed of 19 places in 290 ms
[2020-05-12 03:53:07] [INFO ] Deduced a trap composed of 22 places in 253 ms
[2020-05-12 03:53:07] [INFO ] Deduced a trap composed of 24 places in 245 ms
[2020-05-12 03:53:07] [INFO ] Deduced a trap composed of 25 places in 565 ms
[2020-05-12 03:53:08] [INFO ] Deduced a trap composed of 22 places in 664 ms
[2020-05-12 03:53:08] [INFO ] Deduced a trap composed of 29 places in 266 ms
[2020-05-12 03:53:09] [INFO ] Deduced a trap composed of 21 places in 264 ms
[2020-05-12 03:53:09] [INFO ] Deduced a trap composed of 26 places in 365 ms
[2020-05-12 03:53:09] [INFO ] Deduced a trap composed of 24 places in 250 ms
[2020-05-12 03:53:10] [INFO ] Deduced a trap composed of 30 places in 340 ms
[2020-05-12 03:53:10] [INFO ] Deduced a trap composed of 120 places in 243 ms
[2020-05-12 03:53:10] [INFO ] Deduced a trap composed of 22 places in 241 ms
[2020-05-12 03:53:11] [INFO ] Deduced a trap composed of 31 places in 253 ms
[2020-05-12 03:53:11] [INFO ] Deduced a trap composed of 24 places in 271 ms
[2020-05-12 03:53:13] [INFO ] Deduced a trap composed of 138 places in 2224 ms
[2020-05-12 03:53:14] [INFO ] Deduced a trap composed of 32 places in 503 ms
[2020-05-12 03:53:14] [INFO ] Deduced a trap composed of 29 places in 376 ms
[2020-05-12 03:53:14] [INFO ] Deduced a trap composed of 29 places in 401 ms
[2020-05-12 03:53:15] [INFO ] Deduced a trap composed of 55 places in 447 ms
[2020-05-12 03:53:15] [INFO ] Deduced a trap composed of 140 places in 425 ms
[2020-05-12 03:53:16] [INFO ] Deduced a trap composed of 62 places in 382 ms
[2020-05-12 03:53:16] [INFO ] Deduced a trap composed of 29 places in 383 ms
[2020-05-12 03:53:17] [INFO ] Deduced a trap composed of 119 places in 415 ms
[2020-05-12 03:53:17] [INFO ] Deduced a trap composed of 26 places in 227 ms
[2020-05-12 03:53:17] [INFO ] Deduced a trap composed of 36 places in 322 ms
[2020-05-12 03:53:18] [INFO ] Deduced a trap composed of 46 places in 791 ms
[2020-05-12 03:53:19] [INFO ] Deduced a trap composed of 37 places in 369 ms
[2020-05-12 03:53:19] [INFO ] Deduced a trap composed of 29 places in 543 ms
[2020-05-12 03:53:20] [INFO ] Deduced a trap composed of 33 places in 903 ms
[2020-05-12 03:53:21] [INFO ] Deduced a trap composed of 18 places in 430 ms
[2020-05-12 03:53:21] [INFO ] Deduced a trap composed of 139 places in 547 ms
[2020-05-12 03:53:22] [INFO ] Deduced a trap composed of 153 places in 309 ms
[2020-05-12 03:53:22] [INFO ] Deduced a trap composed of 153 places in 182 ms
[2020-05-12 03:53:22] [INFO ] Deduced a trap composed of 140 places in 333 ms
[2020-05-12 03:53:22] [INFO ] Deduced a trap composed of 136 places in 185 ms
[2020-05-12 03:53:23] [INFO ] Deduced a trap composed of 40 places in 181 ms
[2020-05-12 03:53:23] [INFO ] Deduced a trap composed of 39 places in 182 ms
[2020-05-12 03:53:23] [INFO ] Deduced a trap composed of 45 places in 324 ms
[2020-05-12 03:53:24] [INFO ] Deduced a trap composed of 149 places in 322 ms
[2020-05-12 03:53:24] [INFO ] Deduced a trap composed of 45 places in 445 ms
[2020-05-12 03:53:24] [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 s32 s33 s54 s55 s212 s213 s214 s218 s219 s220 s230 s231 s232 s238 s239 s251 s254 s297 s298 s299 s303 s318 s407 s411 s412 s413 s417 s422 s427 s432 s437 s442 s465 s466 s467 s561 s562 s573 s574 s587 s588) 0)") while checking expression at index 3
[2020-05-12 03:53:24] [INFO ] [Real]Absence check using 61 positive place invariants in 128 ms returned sat
[2020-05-12 03:53:24] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 115 ms returned sat
[2020-05-12 03:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:25] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2020-05-12 03:53:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:53:25] [INFO ] [Nat]Absence check using 61 positive place invariants in 64 ms returned sat
[2020-05-12 03:53:25] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 22 ms returned sat
[2020-05-12 03:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:26] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2020-05-12 03:53:29] [INFO ] Deduced a trap composed of 13 places in 2716 ms
[2020-05-12 03:53:29] [INFO ] Deduced a trap composed of 11 places in 245 ms
[2020-05-12 03:53:29] [INFO ] Deduced a trap composed of 134 places in 266 ms
[2020-05-12 03:53:30] [INFO ] Deduced a trap composed of 21 places in 231 ms
[2020-05-12 03:53:30] [INFO ] Deduced a trap composed of 26 places in 590 ms
[2020-05-12 03:53:31] [INFO ] Deduced a trap composed of 118 places in 232 ms
[2020-05-12 03:53:31] [INFO ] Deduced a trap composed of 27 places in 220 ms
[2020-05-12 03:53:31] [INFO ] Deduced a trap composed of 122 places in 223 ms
[2020-05-12 03:53:31] [INFO ] Deduced a trap composed of 17 places in 237 ms
[2020-05-12 03:53:32] [INFO ] Deduced a trap composed of 23 places in 437 ms
[2020-05-12 03:53:32] [INFO ] Deduced a trap composed of 138 places in 212 ms
[2020-05-12 03:53:32] [INFO ] Deduced a trap composed of 141 places in 311 ms
[2020-05-12 03:53:33] [INFO ] Deduced a trap composed of 32 places in 605 ms
[2020-05-12 03:53:33] [INFO ] Deduced a trap composed of 23 places in 306 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 150 places in 368 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 22 places in 190 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 21 places in 215 ms
[2020-05-12 03:53:34] [INFO ] Deduced a trap composed of 135 places in 177 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 120 places in 177 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 136 places in 203 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 135 places in 183 ms
[2020-05-12 03:53:35] [INFO ] Deduced a trap composed of 137 places in 186 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 36 places in 178 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 69 places in 176 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 142 places in 175 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 33 places in 232 ms
[2020-05-12 03:53:36] [INFO ] Deduced a trap composed of 136 places in 170 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 143 places in 170 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 23 places in 177 ms
[2020-05-12 03:53:37] [INFO ] Deduced a trap composed of 142 places in 186 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 137 places in 2587 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 127 places in 171 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 83 places in 167 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 146 places in 165 ms
[2020-05-12 03:53:40] [INFO ] Deduced a trap composed of 20 places in 180 ms
[2020-05-12 03:53:41] [INFO ] Deduced a trap composed of 133 places in 166 ms
[2020-05-12 03:53:41] [INFO ] Deduced a trap composed of 25 places in 163 ms
[2020-05-12 03:53:41] [INFO ] Deduced a trap composed of 143 places in 213 ms
[2020-05-12 03:53:41] [INFO ] Deduced a trap composed of 28 places in 184 ms
[2020-05-12 03:53:42] [INFO ] Deduced a trap composed of 156 places in 178 ms
[2020-05-12 03:53:46] [INFO ] Deduced a trap composed of 140 places in 4734 ms
[2020-05-12 03:53:46] [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 s3 s4 s5 s41 s42 s50 s51 s54 s55 s59 s60 s61 s92 s94 s101 s102 s103 s106 s107 s108 s109 s112 s116 s157 s158 s195 s196 s200 s212 s213 s214 s224 s225 s226 s238 s239 s240 s288 s297 s298 s299 s302 s303 s304 s308 s313 s323 s327 s332 s342 s346 s347 s348 s362 s377 s382 s387 s392 s402 s406 s408 s417 s426 s428 s446 s449 s450 s451 s452 s455 s456 s457 s458 s459 s460 s476 s477 s480 s481 s489 s490 s491 s492 s493 s494 s501 s502 s506 s508 s509 s510 s520 s521 s524 s525 s526 s527 s528 s529 s530 s531 s532 s533 s538 s539 s540 s541 s542 s543 s546 s547 s550 s551 s554 s555 s567 s568 s569 s570 s571 s572 s579 s580 s581 s582 s585 s586 s587 s588 s589 s590 s591 s605 s608 s617 s618 s619) 0)") while checking expression at index 4
[2020-05-12 03:53:46] [INFO ] [Real]Absence check using 61 positive place invariants in 71 ms returned sat
[2020-05-12 03:53:46] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2020-05-12 03:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:47] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2020-05-12 03:53:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:53:48] [INFO ] [Nat]Absence check using 61 positive place invariants in 94 ms returned sat
[2020-05-12 03:53:48] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2020-05-12 03:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:53:49] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2020-05-12 03:53:49] [INFO ] Deduced a trap composed of 13 places in 325 ms
[2020-05-12 03:53:49] [INFO ] Deduced a trap composed of 13 places in 249 ms
[2020-05-12 03:53:55] [INFO ] Deduced a trap composed of 13 places in 5479 ms
[2020-05-12 03:53:55] [INFO ] Deduced a trap composed of 16 places in 225 ms
[2020-05-12 03:53:55] [INFO ] Deduced a trap composed of 19 places in 218 ms
[2020-05-12 03:53:55] [INFO ] Deduced a trap composed of 12 places in 198 ms
[2020-05-12 03:53:56] [INFO ] Deduced a trap composed of 21 places in 183 ms
[2020-05-12 03:53:56] [INFO ] Deduced a trap composed of 32 places in 237 ms
[2020-05-12 03:53:56] [INFO ] Deduced a trap composed of 135 places in 246 ms
[2020-05-12 03:53:56] [INFO ] Deduced a trap composed of 20 places in 185 ms
[2020-05-12 03:53:57] [INFO ] Deduced a trap composed of 16 places in 211 ms
[2020-05-12 03:53:57] [INFO ] Deduced a trap composed of 22 places in 236 ms
[2020-05-12 03:53:59] [INFO ] Deduced a trap composed of 23 places in 2188 ms
[2020-05-12 03:53:59] [INFO ] Deduced a trap composed of 28 places in 282 ms
[2020-05-12 03:54:00] [INFO ] Deduced a trap composed of 25 places in 229 ms
[2020-05-12 03:54:00] [INFO ] Deduced a trap composed of 33 places in 212 ms
[2020-05-12 03:54:00] [INFO ] Deduced a trap composed of 24 places in 201 ms
[2020-05-12 03:54:00] [INFO ] Deduced a trap composed of 23 places in 200 ms
[2020-05-12 03:54:01] [INFO ] Deduced a trap composed of 20 places in 207 ms
[2020-05-12 03:54:01] [INFO ] Deduced a trap composed of 23 places in 201 ms
[2020-05-12 03:54:01] [INFO ] Deduced a trap composed of 17 places in 195 ms
[2020-05-12 03:54:01] [INFO ] Deduced a trap composed of 127 places in 173 ms
[2020-05-12 03:54:01] [INFO ] Deduced a trap composed of 116 places in 179 ms
[2020-05-12 03:54:02] [INFO ] Deduced a trap composed of 135 places in 172 ms
[2020-05-12 03:54:02] [INFO ] Deduced a trap composed of 28 places in 174 ms
[2020-05-12 03:54:02] [INFO ] Deduced a trap composed of 31 places in 176 ms
[2020-05-12 03:54:06] [INFO ] Deduced a trap composed of 127 places in 3507 ms
[2020-05-12 03:54:08] [INFO ] Deduced a trap composed of 31 places in 1895 ms
[2020-05-12 03:54: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 (> (+ s0 s1 s2 s49 s52 s53 s54 s55 s212 s213 s214 s224 s225 s226 s238 s239 s251 s254 s411 s412 s413 s417 s422 s427 s432 s437 s442 s577 s578 s587 s588) 0)") while checking expression at index 5
[2020-05-12 03:54:08] [INFO ] [Real]Absence check using 61 positive place invariants in 347 ms returned sat
[2020-05-12 03:54:08] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 112 ms returned sat
[2020-05-12 03:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:54:12] [INFO ] [Real]Absence check using state equation in 4092 ms returned sat
[2020-05-12 03:54:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:54:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 69 ms returned sat
[2020-05-12 03:54:12] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 41 ms returned sat
[2020-05-12 03:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:54:14] [INFO ] [Nat]Absence check using state equation in 1738 ms returned sat
[2020-05-12 03:54:16] [INFO ] Deduced a trap composed of 17 places in 1636 ms
[2020-05-12 03:54:17] [INFO ] Deduced a trap composed of 22 places in 681 ms
[2020-05-12 03:54:17] [INFO ] Deduced a trap composed of 25 places in 464 ms
[2020-05-12 03:54:17] [INFO ] Deduced a trap composed of 26 places in 373 ms
[2020-05-12 03:54:18] [INFO ] Deduced a trap composed of 16 places in 385 ms
[2020-05-12 03:54:18] [INFO ] Deduced a trap composed of 27 places in 401 ms
[2020-05-12 03:54:19] [INFO ] Deduced a trap composed of 23 places in 1104 ms
[2020-05-12 03:54:20] [INFO ] Deduced a trap composed of 17 places in 373 ms
[2020-05-12 03:54:20] [INFO ] Deduced a trap composed of 16 places in 400 ms
[2020-05-12 03:54:24] [INFO ] Deduced a trap composed of 36 places in 3747 ms
[2020-05-12 03:54:24] [INFO ] Deduced a trap composed of 31 places in 185 ms
[2020-05-12 03:54:25] [INFO ] Deduced a trap composed of 136 places in 449 ms
[2020-05-12 03:54:25] [INFO ] Deduced a trap composed of 24 places in 642 ms
[2020-05-12 03:54:27] [INFO ] Deduced a trap composed of 20 places in 1746 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 44 places in 326 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 20 places in 305 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 139 places in 169 ms
[2020-05-12 03:54:28] [INFO ] Deduced a trap composed of 116 places in 283 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 27 places in 177 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 118 places in 156 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 22 places in 152 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2020-05-12 03:54:29] [INFO ] Deduced a trap composed of 45 places in 154 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 38 places in 149 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 30 places in 149 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 37 places in 146 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 41 places in 147 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 131 places in 155 ms
[2020-05-12 03:54:30] [INFO ] Deduced a trap composed of 132 places in 156 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 147 places in 156 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 75 places in 146 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 136 places in 150 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 137 places in 149 ms
[2020-05-12 03:54:31] [INFO ] Deduced a trap composed of 34 places in 145 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 154 places in 146 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 27 places in 142 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 45 places in 150 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 59 places in 69 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-05-12 03:54:32] [INFO ] Deduced a trap composed of 24 places in 68 ms
[2020-05-12 03:54: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 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s178 s179 s180 s193 s386 s387 s388 s397 s557 s558 s620) 0)") while checking expression at index 6
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-12 03:54:32] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-12 03:54:33] [INFO ] Flatten gal took : 127 ms
[2020-05-12 03:54:33] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 03:54:33] [INFO ] Flatten gal took : 50 ms
FORMULA BusinessProcesses-PT-15-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:54:33] [INFO ] Applying decomposition
[2020-05-12 03:54:33] [INFO ] Flatten gal took : 51 ms
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/graph11513191852792144063.txt, -o, /tmp/graph11513191852792144063.bin, -w, /tmp/graph11513191852792144063.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/graph11513191852792144063.bin, -l, -1, -v, -w, /tmp/graph11513191852792144063.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:54:33] [INFO ] Decomposing Gal with order
[2020-05-12 03:54:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:54:33] [INFO ] Removed a total of 276 redundant transitions.
[2020-05-12 03:54:33] [INFO ] Flatten gal took : 149 ms
[2020-05-12 03:54:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 23 ms.
[2020-05-12 03:54:33] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 22 ms
[2020-05-12 03:54:33] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
built 62 ordering constraints for composite.
built 34 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 28 ordering constraints for composite.
built 19 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 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 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 25 ordering constraints for composite.
built 26 ordering constraints for composite.
built 29 ordering constraints for composite.
built 79 ordering constraints for composite.
built 4 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 17 ordering constraints for composite.
built 88 ordering constraints for composite.
built 16 ordering constraints for composite.
built 21 ordering constraints for composite.
built 34 ordering constraints for composite.
built 15 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.87325e+25,36.6169,790372,17107,67,936395,817,1195,3.3803e+06,71,1978,0


Converting to forward existential form...Done !
original formula: AG(((((i6.u253.p626==0)||(i17.u173.p445==1))&&((i5.u153.p398==0)||(i13.u47.p120==1)))&&((i3.u28.p70==0)||(i13.u249.p614==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((i6.u253.p626==0)||(i17.u173.p445==1))&&((i5.u153.p398==0)||(i13.u47.p120==1)))&&((i3.u28.p70==0)||(i13.u249.p614==1)))))] = FALSE
(forward)formula 0,0,37.0944,790372,1,0,936395,817,1220,3.3803e+06,78,1978,17482
FORMULA BusinessProcesses-PT-15-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((i8.i1.i1.u141.p366!=0)&&(i13.u251.p619!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((i8.i1.i1.u141.p366!=0)&&(i13.u251.p619!=1))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 1,0,65.4574,801896,1,0,1.05418e+06,817,5921,4.5156e+06,279,2056,1623113
FORMULA BusinessProcesses-PT-15-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((AF(((i0.u118.p306==0)||(i4.u57.p143==1))) + ((i17.u175.p1!=0)&&(i16.u88.p231!=1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(((i17.u175.p1!=0)&&(i16.u88.p231!=1)))),!(((i0.u118.p306==0)||(i4.u57.p143==1))))] = FALSE
(forward)formula 2,0,67.1063,856280,1,0,1.19258e+06,817,6417,4.66229e+06,288,2112,1833476
FORMULA BusinessProcesses-PT-15-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((i2.u19.p50==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i2.u19.p50==1))] != FALSE
(forward)formula 3,1,67.1505,857072,1,0,1.19264e+06,817,6419,4.6632e+06,288,2112,1839364
FORMULA BusinessProcesses-PT-15-CTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((i15.u85.p222==0)||(i13.u50.p126==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i15.u85.p222==0)||(i13.u50.p126==1))))] = FALSE
(forward)formula 4,0,67.1957,857600,1,0,1.19334e+06,817,6425,4.67031e+06,288,2112,1842001
FORMULA BusinessProcesses-PT-15-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(!(AG(((i9.u128.p333==0)||(i14.u83.p216==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((i9.u128.p333==0)||(i14.u83.p216==1))))] != FALSE
(forward)formula 5,1,95.6655,1446172,1,0,1.87733e+06,849,6471,7.31248e+06,288,2823,3073540
FORMULA BusinessProcesses-PT-15-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(((i13.u251.p620==0)||(i17.u175.p258==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i13.u251.p620==0)||(i17.u175.p258==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t296, t304, t420, i0.t261, i0.u79.t311, i0.u118.t262, i1.t423, i1.t253, i1.u14.t425, i1.u123.t254, i2.t430, i2.t415, i2.t410, i2.t406, i2.u13.t426, i2.u21.t411, i2.u12.t428, i2.u17.t419, i2.u20.t413, i2.u22.t409, i3.t405, i3.t401, i3.t399, i3.t397, i3.t395, i3.t392, i3.t390, i4.u56.t353, i4.u58.t349, i5.t335, i5.t189, i5.u69.t329, i5.u71.t325, i5.u73.t321, i5.u154.t190, i6.t181, i6.u75.t317, i6.u157.t182, i7.t197, i7.t193, i7.t185, i7.t177, i7.t173, i7.u150.t198, i7.u151.t194, i7.u155.t186, i7.u160.t178, i7.u161.t174, i8.i0.i0.u63.t339, i8.i0.i1.t343, i8.i0.i1.u60.t345, i8.i0.i2.t201, i8.i0.i2.u148.t202, i8.i1.i1.t213, i8.i1.i1.u141.t214, i8.i1.i2.t209, i8.i1.i2.u143.t210, i8.i1.i3.t205, i8.i1.i3.u145.t206, i9.t237, i9.t233, i9.t229, i9.t217, i9.u130.t238, i9.u131.t234, i9.u134.t230, i9.u139.t218, i10.u33.t387, i10.u35.t383, i11.t272, i11.t269, i11.t265, i11.t257, i11.t249, i11.u112.t273, i11.u115.t270, i11.u117.t266, i11.u120.t258, i11.u124.t250, i12.t125, i12.u181.t129, i13.t361, i13.t359, i13.t357, i13.t245, i13.t225, i13.t221, i13.u127.t246, i13.u136.t226, i13.u38.t365, i13.u38.t369, i13.u38.t373, i13.u38.t379, i13.u137.t222, i14.u81.t307, i14.u83.t303, i15.t292, i15.t289, i15.t286, i15.t282, i15.t153, i15.u85.t299, i15.u87.t295, i15.u92.t285, i15.u89.t291, i15.u171.t154, i16.t169, i16.t165, i16.t161, i16.t157, i16.u163.t170, i16.u166.t166, i16.u168.t162, i16.u170.t158, i17.t149, i17.u95.t278, i17.u173.t150, i18.t111, i18.u189.t115, i19.t143, i19.t136, i19.t131, i19.t127, i19.t123, i19.t121, i19.t118, i19.t113, i19.t109, i19.t106, i19.t104, i19.t102, i19.t100, i19.t97, i19.t69, i19.t66, i19.t63, i19.t61, i19.t58, i19.t55, i19.t53, i19.t51, i19.t48, i19.t45, i19.t37, i19.t34, i19.t31, i19.t28, i19.t25, i19.t22, i19.t20, i19.t17, i19.t14, i19.u241.t12, i19.u241.t42, i19.u241.t80, i19.u241.t84, i19.u241.t88, i19.u241.t94, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/365/159/560
(forward)formula 6,1,166.602,2322136,1,0,3.08842e+06,942,3762,1.06662e+07,180,3089,557495
FORMULA BusinessProcesses-PT-15-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((AX(((i19.u214.p540==0)||(i8.i1.i3.u146.p378==1))) * AG(((i8.i1.i2.u143.p371==0)||(i8.i0.i2.u148.p382==1)))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(((i19.u214.p540==0)||(i8.i1.i3.u146.p378==1))))] = FALSE * [(FwdU(FwdU(Init,TRUE),TRUE) * !(((i8.i1.i2.u143.p371==0)||(i8.i0.i2.u148.p382==1))))] = FALSE)
(forward)formula 7,0,170.912,2322136,1,0,3.08842e+06,942,5962,1.06662e+07,229,3089,1463634
FORMULA BusinessProcesses-PT-15-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((EG(((i17.u175.p258==0)||(i19.u184.p473==1))) * (i2.u12.p33!=0)) * (i13.u126.p324!=1)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (i13.u126.p324!=1)) * (i2.u12.p33!=0)),((i17.u175.p258==0)||(i19.u184.p473==1)))] != FALSE
(forward)formula 8,1,261.686,2322136,1,0,3.08842e+06,942,6216,1.06662e+07,240,3089,2992576
FORMULA BusinessProcesses-PT-15-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AG(((i12.u183.p471==0)||(i9.u131.p342==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i12.u183.p471==0)||(i9.u131.p342==1))))))] != FALSE
(forward)formula 9,1,268.608,2322136,1,0,3.08842e+06,942,6228,1.06662e+07,240,3089,3750289
FORMULA BusinessProcesses-PT-15-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589255943292

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

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

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