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.r186-oct2-158987938500116.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 itslola
Input is RefineWMG-PT-100100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 3.7K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 12:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 218K Mar 24 05:38 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 n0-CTLFireability-00
FORMULA_NAME n0-CTLFireability-01
FORMULA_NAME n0-CTLFireability-02
FORMULA_NAME n0-CTLFireability-03
FORMULA_NAME n0-CTLFireability-04
FORMULA_NAME n0-CTLFireability-05
FORMULA_NAME n0-CTLFireability-06
FORMULA_NAME n0-CTLFireability-07
FORMULA_NAME n0-CTLFireability-08
FORMULA_NAME n0-CTLFireability-09
FORMULA_NAME n0-CTLFireability-10
FORMULA_NAME n0-CTLFireability-11
FORMULA_NAME n0-CTLFireability-12
FORMULA_NAME n0-CTLFireability-13
FORMULA_NAME n0-CTLFireability-14
FORMULA_NAME n0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591227770357

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:42:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:42:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:42:52] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-06-03 23:42:52] [INFO ] Transformed 504 places.
[2020-06-03 23:42:52] [INFO ] Transformed 403 transitions.
[2020-06-03 23:42:52] [INFO ] Parsed PT model containing 504 places and 403 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Incomplete random walk after 100084 steps, including 0 resets, run finished after 470 ms. (steps per millisecond=212 ) properties seen :[1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 403 rows 504 cols
[2020-06-03 23:42:55] [INFO ] Computed 202 place invariants in 10 ms
[2020-06-03 23:42:55] [INFO ] [Real]Absence check using 202 positive place invariants in 112 ms returned sat
[2020-06-03 23:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:42:56] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2020-06-03 23:42:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:42:56] [INFO ] [Nat]Absence check using 202 positive place invariants in 87 ms returned sat
[2020-06-03 23:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:42:57] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2020-06-03 23:42:57] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:42:59] [INFO ] Added : 136 causal constraints over 28 iterations in 2087 ms. Result :sat
[2020-06-03 23:42:59] [INFO ] [Real]Absence check using 202 positive place invariants in 107 ms returned sat
[2020-06-03 23:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:00] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2020-06-03 23:43:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:00] [INFO ] [Nat]Absence check using 202 positive place invariants in 71 ms returned sat
[2020-06-03 23:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:00] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-06-03 23:43:00] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2020-06-03 23:43:01] [INFO ] Added : 98 causal constraints over 20 iterations in 503 ms. Result :sat
[2020-06-03 23:43:01] [INFO ] [Real]Absence check using 202 positive place invariants in 66 ms returned sat
[2020-06-03 23:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:01] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2020-06-03 23:43:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:02] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:02] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2020-06-03 23:43:02] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:43:03] [INFO ] Added : 105 causal constraints over 21 iterations in 581 ms. Result :sat
[2020-06-03 23:43:03] [INFO ] [Real]Absence check using 202 positive place invariants in 53 ms returned sat
[2020-06-03 23:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:03] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2020-06-03 23:43:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:03] [INFO ] [Nat]Absence check using 202 positive place invariants in 56 ms returned sat
[2020-06-03 23:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:04] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2020-06-03 23:43:04] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:43:04] [INFO ] Added : 104 causal constraints over 21 iterations in 577 ms. Result :sat
[2020-06-03 23:43:04] [INFO ] [Real]Absence check using 202 positive place invariants in 58 ms returned sat
[2020-06-03 23:43:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:05] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2020-06-03 23:43:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:05] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:05] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2020-06-03 23:43:05] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 12 ms.
[2020-06-03 23:43:06] [INFO ] Added : 111 causal constraints over 23 iterations in 491 ms. Result :sat
[2020-06-03 23:43:06] [INFO ] [Real]Absence check using 202 positive place invariants in 57 ms returned sat
[2020-06-03 23:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:06] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2020-06-03 23:43:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:07] [INFO ] [Nat]Absence check using 202 positive place invariants in 106 ms returned sat
[2020-06-03 23:43:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:07] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2020-06-03 23:43:07] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 30 ms.
[2020-06-03 23:43:08] [INFO ] Added : 84 causal constraints over 17 iterations in 399 ms. Result :sat
[2020-06-03 23:43:08] [INFO ] [Real]Absence check using 202 positive place invariants in 71 ms returned sat
[2020-06-03 23:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:08] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2020-06-03 23:43:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:08] [INFO ] [Nat]Absence check using 202 positive place invariants in 85 ms returned sat
[2020-06-03 23:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:09] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2020-06-03 23:43:09] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2020-06-03 23:43:09] [INFO ] Added : 75 causal constraints over 15 iterations in 312 ms. Result :sat
[2020-06-03 23:43:09] [INFO ] [Real]Absence check using 202 positive place invariants in 58 ms returned sat
[2020-06-03 23:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:10] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2020-06-03 23:43:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:10] [INFO ] [Nat]Absence check using 202 positive place invariants in 58 ms returned sat
[2020-06-03 23:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:10] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2020-06-03 23:43:10] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:43:11] [INFO ] Added : 140 causal constraints over 28 iterations in 607 ms. Result :sat
[2020-06-03 23:43:11] [INFO ] [Real]Absence check using 202 positive place invariants in 97 ms returned sat
[2020-06-03 23:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:11] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2020-06-03 23:43:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:12] [INFO ] [Nat]Absence check using 202 positive place invariants in 98 ms returned sat
[2020-06-03 23:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:12] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2020-06-03 23:43:12] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:43:13] [INFO ] Added : 197 causal constraints over 40 iterations in 894 ms. Result :sat
[2020-06-03 23:43:13] [INFO ] [Real]Absence check using 202 positive place invariants in 57 ms returned sat
[2020-06-03 23:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:14] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2020-06-03 23:43:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:14] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:14] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2020-06-03 23:43:14] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:43:15] [INFO ] Added : 169 causal constraints over 34 iterations in 789 ms. Result :sat
[2020-06-03 23:43:15] [INFO ] [Real]Absence check using 202 positive place invariants in 69 ms returned sat
[2020-06-03 23:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:16] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2020-06-03 23:43:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:16] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:16] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2020-06-03 23:43:16] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 13 ms.
[2020-06-03 23:43:17] [INFO ] Added : 185 causal constraints over 37 iterations in 878 ms. Result :sat
[2020-06-03 23:43:17] [INFO ] [Real]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:18] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2020-06-03 23:43:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:18] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:18] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2020-06-03 23:43:18] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:43:19] [INFO ] Added : 76 causal constraints over 16 iterations in 383 ms. Result :sat
[2020-06-03 23:43:19] [INFO ] [Real]Absence check using 202 positive place invariants in 65 ms returned sat
[2020-06-03 23:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:19] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2020-06-03 23:43:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:19] [INFO ] [Nat]Absence check using 202 positive place invariants in 58 ms returned sat
[2020-06-03 23:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:20] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2020-06-03 23:43:20] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2020-06-03 23:43:20] [INFO ] Added : 22 causal constraints over 5 iterations in 149 ms. Result :sat
[2020-06-03 23:43:20] [INFO ] [Real]Absence check using 202 positive place invariants in 117 ms returned sat
[2020-06-03 23:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:21] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2020-06-03 23:43:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:21] [INFO ] [Nat]Absence check using 202 positive place invariants in 130 ms returned sat
[2020-06-03 23:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:21] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2020-06-03 23:43:21] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:43:21] [INFO ] Added : 20 causal constraints over 4 iterations in 157 ms. Result :sat
[2020-06-03 23:43:22] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:43:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:22] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2020-06-03 23:43:22] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:43:22] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
[2020-06-03 23:43:22] [INFO ] [Real]Absence check using 202 positive place invariants in 73 ms returned sat
[2020-06-03 23:43:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:23] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2020-06-03 23:43:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:23] [INFO ] [Nat]Absence check using 202 positive place invariants in 97 ms returned sat
[2020-06-03 23:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:23] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2020-06-03 23:43:23] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2020-06-03 23:43:24] [INFO ] Added : 144 causal constraints over 29 iterations in 602 ms. Result :sat
[2020-06-03 23:43:24] [INFO ] [Real]Absence check using 202 positive place invariants in 124 ms returned sat
[2020-06-03 23:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:25] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2020-06-03 23:43:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:25] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:25] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2020-06-03 23:43:25] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:43:26] [INFO ] Added : 105 causal constraints over 21 iterations in 491 ms. Result :sat
[2020-06-03 23:43:26] [INFO ] [Real]Absence check using 202 positive place invariants in 102 ms returned sat
[2020-06-03 23:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:26] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2020-06-03 23:43:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:27] [INFO ] [Nat]Absence check using 202 positive place invariants in 70 ms returned sat
[2020-06-03 23:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:27] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2020-06-03 23:43:27] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2020-06-03 23:43:27] [INFO ] Added : 32 causal constraints over 7 iterations in 176 ms. Result :sat
[2020-06-03 23:43:27] [INFO ] [Real]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:28] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2020-06-03 23:43:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 566 ms returned sat
[2020-06-03 23:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:29] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-06-03 23:43:29] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:43:29] [INFO ] Added : 75 causal constraints over 15 iterations in 343 ms. Result :sat
[2020-06-03 23:43:29] [INFO ] [Real]Absence check using 202 positive place invariants in 57 ms returned sat
[2020-06-03 23:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:30] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2020-06-03 23:43:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:30] [INFO ] [Nat]Absence check using 202 positive place invariants in 58 ms returned sat
[2020-06-03 23:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:30] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2020-06-03 23:43:30] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 13 ms.
[2020-06-03 23:43:31] [INFO ] Added : 136 causal constraints over 28 iterations in 667 ms. Result :sat
[2020-06-03 23:43:31] [INFO ] [Real]Absence check using 202 positive place invariants in 55 ms returned sat
[2020-06-03 23:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:31] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2020-06-03 23:43:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:43:32] [INFO ] [Nat]Absence check using 202 positive place invariants in 55 ms returned sat
[2020-06-03 23:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:43:32] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2020-06-03 23:43:32] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 14 ms.
[2020-06-03 23:43:32] [INFO ] Added : 47 causal constraints over 10 iterations in 220 ms. Result :sat
[2020-06-03 23:43:32] [INFO ] Flatten gal took : 79 ms
[2020-06-03 23:43:32] [INFO ] Flatten gal took : 21 ms
[2020-06-03 23:43:32] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 23:43:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RefineWMG-PT-100100 @ 3570 seconds

FORMULA n0-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1070
rslt: Output for CTLFireability @ RefineWMG-PT-100100

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:44:00 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p37 <= 0)))",
"processed_size": 18,
"rewrites": 17
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p90 <= 0)",
"processed_size": 10,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 247
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 247
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p93)",
"processed_size": 10,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 247
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 247
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((1 <= p230) OR (p3 <= 2)) AND (((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR ((1 <= p98) AND (1 <= p292))))",
"processed_size": 111,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((1 <= p98) U (1 <= p102)))",
"processed_size": 30,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AX(((1 <= p138) OR ((1 <= p381) AND (1 <= p382) AND (1 <= p384)) OR ((1 <= p191) AND (1 <= p192) AND (1 <= p194) AND (1 <= p168))))",
"processed_size": 133,
"rewrites": 17
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(((1 <= p382) AND EX((1 <= p150))))",
"processed_size": 37,
"rewrites": 18
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p292 <= 0)",
"processed_size": 11,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p208)",
"processed_size": 11,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG(E(((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302)))",
"processed_size": 66,
"rewrites": 18
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 202,
"markings": 101,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p263)",
"processed_size": 11,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p355)))",
"processed_size": 19,
"rewrites": 17
},
"result":
{
"edges": 31,
"markings": 32,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p451) AND (1 <= p452) AND (1 <= p454))))",
"processed_size": 53,
"rewrites": 17
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 537
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 537
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p250 <= 0)",
"processed_size": 11,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 717
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p441) AND (1 <= p442) AND (1 <= p444)) OR ((1 <= p256) AND (1 <= p257) AND (1 <= p259)))))",
"processed_size": 105,
"rewrites": 17
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 716
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((p390 <= 0) U ((1 <= p112) OR ((1 <= p196) AND (1 <= p197) AND (1 <= p199)))))",
"processed_size": 83,
"rewrites": 18
},
"result":
{
"edges": 1402786,
"markings": 704912,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1073
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((F ((p480 <= 0)) OR ((1 <= p437) AND (1 <= p502) AND (1 <= p132) AND (1 <= p68) AND (1 <= p253))))",
"processed_size": 101,
"rewrites": 18
},
"result":
{
"edges": 561,
"markings": 440,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2147
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2147
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p8) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0)))",
"processed_size": 71,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p67 <= 0)))",
"processed_size": 18,
"rewrites": 17
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p90 <= 0)",
"processed_size": 10,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p93)",
"processed_size": 10,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p292 <= 0)",
"processed_size": 11,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p208)",
"processed_size": 11,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG(E(((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302)))",
"processed_size": 66,
"rewrites": 18
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 202,
"markings": 101,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p263)",
"processed_size": 11,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p8) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0)))",
"processed_size": 71,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 24,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((1 <= p422)))",
"processed_size": 19,
"rewrites": 17
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 25,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p67 <= 0)))",
"processed_size": 18,
"rewrites": 17
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 26,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 24,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4060,
"runtime": 2500.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((E(X(**)) U A((** U **)))) : (E(F(**)) AND **) : E(((** AND A(G(**))) U A(G(*)))) : E(((E(F(**)) OR (** OR **)) U (A(G(**)) AND (** AND **)))) : (E(F(A(X(*)))) OR E(F(**))) : (E(F(**)) AND (E(G(**)) OR (E(F(*)) AND (** AND **)))) : (** AND E(F(A(X(**))))) : (** OR A(X(E(F(**))))) : A(G(A((** U **)))) : E(F(**)) : A(G((A(F(**)) OR **))) : (E(X((** AND E(X(**))))) OR (A(X(**)) AND (A((** U **)) OR **))) : E((A(G(*)) U A(F(**)))) : E(F(**)) : (E(G(E((** U **)))) AND (E((** U **)) OR (** AND (E(X(**)) OR A(F(**)))))) : (** OR E(X(E((** U **)))))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "unknown yes unknown unknown yes yes unknown unknown no yes no no unknown yes unknown unknown ",
"value": "unknown yes unknown unknown yes yes unknown unknown no yes no no unknown yes unknown unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 907/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: E ((E (X ((p238 <= 0))) U A (((1 <= p72) U (1 <= p195))))) : (E (F ((((1 <= p441) AND (1 <= p442) AND (1 <= p444)) OR ((1 <= p256) AND (1 <= p257) AND (1 <= p259))))) AND (p250 <= 0)) : E ((((p255 <= 0) AND A (G ((1 <= p495)))) U NOT(E (F ((1 <= p235)))))) : E ((((E (F ((1 <= p58))) OR (p153 <= 0)) OR (p3 <= 2)) U ((A (G (((1 <= p291) AND (1 <= p292) AND (1 <= p294)))) AND (p430 <= 0)) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0))))) : E (F ((NOT(E (X ((1 <= p93)))) OR (p37 <= 0)))) : (E (F ((p67 <= 0))) AND (E (G ((1 <= p422))) OR ((NOT(A (G ((1 <= p128)))) AND (1 <= p8)) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0))))) : ((p90 <= 0) AND E (F (A (X (((1 <= p250) AND (1 <= p40))))))) : ((1 <= p93) OR A (X (E (F ((((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR (1 <= p173))))))) : A (G (A (((p390 <= 0) U ((1 <= p112) OR ((1 <= p196) AND (1 <= p197) AND (1 <= p199))))))) : E (F (((1 <= p451) AND (1 <= p452) AND (1 <= p454)))) : A (G ((A (F ((p480 <= 0))) OR ((1 <= p437) AND (1 <= p502) AND (1 <= p132) AND (1 <= p68) AND (1 <= p253))))) : (E (X (((1 <= p382) AND E (X ((1 <= p150)))))) OR (A (X (((1 <= p138) OR ((1 <= p381) AND (1 <= p382) AND (1 <= p384)) OR ((1 <= p191) AND (1 <= p192) AND (1 <= p194) AND (1 <= p168))))) AND (A (((1 <= p98) U (1 <= p102))) OR (((1 <= p230) OR (p3 <= 2)) AND (((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR ((1 <= p98) AND (1 <= p292))))))) : E ((NOT(E (F ((1 <= p250)))) U A (F (((1 <= p426) AND (1 <= p427) AND (1 <= p429)))))) : E (F ((1 <= p355))) : (E (G (E ((((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302))))) AND (E (((p453 <= 0) U ((1 <= p391) AND (1 <= p392) AND (1 <= p394)))) OR ((1 <= p208) AND (E (X ((1 <= p138))) OR A (F ((1 <= p292))))))) : ((1 <= p263) OR E (X (E (((1 <= p437) U (1 <= p495))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p238 <= 0))) U A (((1 <= p72) U (1 <= p195)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((p238 <= 0)) U A((1 <= p72) U (1 <= p195)))
lola: processed formula length: 48
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 640544 markings, 2245030 edges, 128109 markings/sec, 0 secs
lola: 1294115 markings, 4535736 edges, 130714 markings/sec, 5 secs
lola: 1928690 markings, 6759998 edges, 126915 markings/sec, 10 secs
lola: 2551166 markings, 8941759 edges, 124495 markings/sec, 15 secs
lola: 3176753 markings, 11134338 edges, 125117 markings/sec, 20 secs
lola: 3814063 markings, 13368103 edges, 127462 markings/sec, 25 secs
lola: 4420086 markings, 15492308 edges, 121205 markings/sec, 30 secs
lola: 5035601 markings, 17649684 edges, 123103 markings/sec, 35 secs
lola: 5656315 markings, 19825285 edges, 124143 markings/sec, 40 secs
lola: 6272405 markings, 21984674 edges, 123218 markings/sec, 45 secs
lola: 6882443 markings, 24122793 edges, 122008 markings/sec, 50 secs
lola: 7502785 markings, 26297073 edges, 124068 markings/sec, 55 secs
lola: 8115228 markings, 28443640 edges, 122489 markings/sec, 60 secs
lola: 8727340 markings, 30589237 edges, 122422 markings/sec, 65 secs
lola: 9350075 markings, 32771798 edges, 124547 markings/sec, 70 secs
lola: 9966579 markings, 34932694 edges, 123301 markings/sec, 75 secs
lola: 10574436 markings, 37063315 edges, 121571 markings/sec, 80 secs
lola: 11180880 markings, 39188922 edges, 121289 markings/sec, 85 secs
lola: 11801437 markings, 41363953 edges, 124111 markings/sec, 90 secs
lola: 12412809 markings, 43506797 edges, 122274 markings/sec, 95 secs
lola: 13024253 markings, 45649760 edges, 122289 markings/sec, 100 secs
lola: 13641632 markings, 47813820 edges, 123476 markings/sec, 105 secs
lola: 14249989 markings, 49946080 edges, 121671 markings/sec, 110 secs
lola: 14861645 markings, 52089766 edges, 122331 markings/sec, 115 secs
lola: 15479446 markings, 54255362 edges, 123560 markings/sec, 120 secs
lola: 15516409 markings, 54384968 edges, 7393 markings/sec, 125 secs
lola: 15653689 markings, 54872879 edges, 27456 markings/sec, 130 secs
lola: 15671200 markings, 54927396 edges, 3502 markings/sec, 135 secs
lola: 15671382 markings, 54928083 edges, 36 markings/sec, 140 secs
lola: 15725601 markings, 55118110 edges, 10844 markings/sec, 145 secs
lola: 15725601 markings, 55118110 edges, 0 markings/sec, 150 secs
lola: 15883161 markings, 55670338 edges, 31512 markings/sec, 155 secs
lola: 16006367 markings, 56102017 edges, 24641 markings/sec, 160 secs
lola: 16006566 markings, 56102723 edges, 40 markings/sec, 165 secs
lola: 16127847 markings, 56528011 edges, 24256 markings/sec, 170 secs
lola: 16128736 markings, 56531034 edges, 178 markings/sec, 175 secs
lola: 16129191 markings, 56532503 edges, 91 markings/sec, 180 secs
lola: 16276202 markings, 57047917 edges, 29402 markings/sec, 185 secs
lola: 16318715 markings, 57197036 edges, 8503 markings/sec, 190 secs
lola: 16411876 markings, 57523560 edges, 18632 markings/sec, 195 secs
lola: 16523484 markings, 57914575 edges, 22322 markings/sec, 200 secs
lola: 16523484 markings, 57914575 edges, 0 markings/sec, 205 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((p93 <= 0))))) OR E (F ((p37 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p37 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p37 <= 0)))
lola: processed formula length: 18
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p37 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p90 <= 0) AND E (F (A (X (((1 <= p250) AND (1 <= p40)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p90 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p90 <= 0)
lola: processed formula length: 10
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p250) AND (1 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p250) AND (1 <= p40))))
lola: processed formula length: 36
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
sara: try reading problem file CTLFireability-0.sara.
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 1228337 markings, 1848570 edges, 245667 markings/sec, 0 secs
lola: 2819008 markings, 4242502 edges, 318134 markings/sec, 5 secs
lola: 4021929 markings, 6052935 edges, 240584 markings/sec, 10 secs
lola: 5211278 markings, 7842838 edges, 237870 markings/sec, 15 secs
lola: 6362360 markings, 9575305 edges, 230216 markings/sec, 20 secs
lola: 7541012 markings, 11349120 edges, 235730 markings/sec, 25 secs
lola: 8699128 markings, 13092121 edges, 231623 markings/sec, 30 secs
lola: 9885421 markings, 14877458 edges, 237259 markings/sec, 35 secs
lola: 11046994 markings, 16625627 edges, 232315 markings/sec, 40 secs
lola: 12236737 markings, 18416242 edges, 237949 markings/sec, 45 secs
lola: 13406295 markings, 20176386 edges, 233912 markings/sec, 50 secs
lola: 14569038 markings, 21926371 edges, 232549 markings/sec, 55 secs
lola: 15700516 markings, 23629151 edges, 226296 markings/sec, 60 secs
lola: 16175757 markings, 24344541 edges, 95048 markings/sec, 65 secs
lola: 16725988 markings, 25172563 edges, 110046 markings/sec, 70 secs
lola: 17213632 markings, 25906469 edges, 97529 markings/sec, 75 secs
lola: 17706108 markings, 26647683 edges, 98495 markings/sec, 80 secs
lola: 18087762 markings, 27231886 edges, 76331 markings/sec, 85 secs
lola: 18534806 markings, 27894777 edges, 89409 markings/sec, 90 secs
lola: 19237155 markings, 28951819 edges, 140470 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 3 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p93) OR A (X (E (F ((((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR (1 <= p173)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p93)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p93)
lola: processed formula length: 10
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR (1 <= p173))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR (1 <= p173))))
lola: processed formula length: 71
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1457787 markings, 2193870 edges, 291557 markings/sec, 0 secs
lola: 2865615 markings, 4312641 edges, 281566 markings/sec, 5 secs
lola: 4264643 markings, 6418266 edges, 279806 markings/sec, 10 secs
lola: 5663870 markings, 8524051 edges, 279845 markings/sec, 15 secs
lola: 7044052 markings, 10601181 edges, 276036 markings/sec, 20 secs
lola: 8446878 markings, 12712512 edges, 280565 markings/sec, 25 secs
lola: 9842612 markings, 14813038 edges, 279147 markings/sec, 30 secs
lola: 11217542 markings, 16882293 edges, 274986 markings/sec, 35 secs
lola: 12613131 markings, 18982695 edges, 279118 markings/sec, 40 secs
lola: 13988419 markings, 21052465 edges, 275058 markings/sec, 45 secs
lola: 15354766 markings, 23108800 edges, 273269 markings/sec, 50 secs
lola: 16742257 markings, 25196990 edges, 277498 markings/sec, 55 secs
lola: 18129170 markings, 27284293 edges, 277383 markings/sec, 60 secs
lola: 19497169 markings, 29343110 edges, 273600 markings/sec, 65 secs
lola: 20877427 markings, 31420434 edges, 276052 markings/sec, 70 secs
lola: 22250683 markings, 33487197 edges, 274651 markings/sec, 75 secs
lola: 23604664 markings, 35524937 edges, 270796 markings/sec, 80 secs
lola: 25006755 markings, 37635091 edges, 280418 markings/sec, 85 secs
lola: 26354857 markings, 39664008 edges, 269620 markings/sec, 90 secs
lola: 26522457 markings, 39916281 edges, 33520 markings/sec, 95 secs
lola: 27430492 markings, 41282748 edges, 181607 markings/sec, 100 secs
lola: 28463747 markings, 42837856 edges, 206651 markings/sec, 105 secs
lola: 28535417 markings, 42945692 edges, 14334 markings/sec, 110 secs
lola: 28535417 markings, 42945692 edges, 0 markings/sec, 115 secs
lola: 28535417 markings, 42945692 edges, 0 markings/sec, 120 secs
lola: 28544465 markings, 42959356 edges, 1810 markings/sec, 125 secs
lola: 29528955 markings, 44440987 edges, 196898 markings/sec, 130 secs
lola: 30727305 markings, 46244522 edges, 239670 markings/sec, 135 secs
lola: 30767917 markings, 46305642 edges, 8122 markings/sec, 140 secs
lola: 30767917 markings, 46305642 edges, 0 markings/sec, 145 secs
lola: 30767917 markings, 46305642 edges, 0 markings/sec, 150 secs
lola: 30767917 markings, 46305642 edges, 0 markings/sec, 155 secs
lola: 31627869 markings, 47599830 edges, 171990 markings/sec, 160 secs
lola: 31660666 markings, 47649229 edges, 6559 markings/sec, 165 secs
lola: 31660666 markings, 47649229 edges, 0 markings/sec, 170 secs
lola: 31660666 markings, 47649229 edges, 0 markings/sec, 175 secs
lola: 31660666 markings, 47649229 edges, 0 markings/sec, 180 secs
lola: 32320028 markings, 48641563 edges, 131872 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 4 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((1 <= p382) AND E (X ((1 <= p150)))))) OR (A (X (((1 <= p138) OR ((1 <= p381) AND (1 <= p382) AND (1 <= p384)) OR ((1 <= p191) AND (1 <= p192) AND (1 <= p194) AND (1 <= p168))))) AND (A (((1 <= p98) U (1 <= p102))) OR (((1 <= p230) OR (p3 <= 2)) AND (((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR ((1 <= p98) AND (1 <= p292)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p230) OR (p3 <= 2)) AND (((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR ((1 <= p98) AND (1 <= p292))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p230) OR (p3 <= 2)) AND (((1 <= p76) AND (1 <= p77) AND (1 <= p79)) OR ((1 <= p98) AND (1 <= p292))))
lola: processed formula length: 111
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p98) U (1 <= p102)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((1 <= p98) U (1 <= p102)))
lola: processed formula length: 30
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p98)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p138) OR ((1 <= p381) AND (1 <= p382) AND (1 <= p384)) OR ((1 <= p191) AND (1 <= p192) AND (1 <= p194) AND (1 <= p168)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p138) OR ((1 <= p381) AND (1 <= p382) AND (1 <= p384)) OR ((1 <= p191) AND (1 <= p192) AND (1 <= p194) AND (1 <= p168))))
lola: processed formula length: 133
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p382) AND E (X ((1 <= p150))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p382) AND EX((1 <= p150))))
lola: processed formula length: 37
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E ((((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302))))) AND (E (((p453 <= 0) U ((1 <= p391) AND (1 <= p392) AND (1 <= p394)))) OR ((1 <= p208) AND (E (X ((1 <= p138))) OR A (F ((1 <= p292)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p292)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p292 <= 0)
lola: processed formula length: 11
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p292)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 6 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p208)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p208)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p453 <= 0) U ((1 <= p391) AND (1 <= p392) AND (1 <= p394))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p453 <= 0) U ((1 <= p391) AND (1 <= p392) AND (1 <= p394))))
lola: processed formula length: 65
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p391) AND (1 <= p392) AND (1 <= p394))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 1299620 markings, 1955835 edges, 259924 markings/sec, 0 secs
lola: sara is running 5 secs || 2558087 markings, 3849836 edges, 251693 markings/sec, 5 secs
lola: sara is running 10 secs || 3827683 markings, 5760599 edges, 253919 markings/sec, 10 secs
lola: sara is running 15 secs || 5083639 markings, 7650760 edges, 251191 markings/sec, 15 secs
lola: sara is running 20 secs || 6332600 markings, 9530463 edges, 249792 markings/sec, 20 secs
lola: sara is running 25 secs || 7570040 markings, 11392823 edges, 247488 markings/sec, 25 secs
lola: sara is running 30 secs || 8805157 markings, 13251674 edges, 247023 markings/sec, 30 secs
lola: sara is running 35 secs || 10044158 markings, 15116361 edges, 247800 markings/sec, 35 secs
lola: sara is running 40 secs || 11270151 markings, 16961466 edges, 245199 markings/sec, 40 secs
lola: sara is running 45 secs || 12503320 markings, 18817430 edges, 246634 markings/sec, 45 secs
lola: sara is running 50 secs || 13735722 markings, 20672157 edges, 246480 markings/sec, 50 secs
lola: sara is running 55 secs || 14949093 markings, 22498281 edges, 242674 markings/sec, 55 secs
lola: sara is running 60 secs || 16139500 markings, 24289864 edges, 238081 markings/sec, 60 secs
lola: sara is running 65 secs || 17365374 markings, 26134800 edges, 245175 markings/sec, 65 secs
lola: sara is running 70 secs || 18593769 markings, 27983536 edges, 245679 markings/sec, 70 secs
lola: sara is running 75 secs || 19813431 markings, 29819120 edges, 243932 markings/sec, 75 secs
lola: sara is running 80 secs || 21024157 markings, 31641272 edges, 242145 markings/sec, 80 secs
lola: sara is running 85 secs || 22211189 markings, 33427734 edges, 237406 markings/sec, 85 secs
lola: sara is running 90 secs || 23401126 markings, 35218631 edges, 237987 markings/sec, 90 secs
lola: sara is running 95 secs || 24620632 markings, 37053978 edges, 243901 markings/sec, 95 secs
lola: sara is running 100 secs || 25837636 markings, 38885529 edges, 243401 markings/sec, 100 secs
lola: sara is running 105 secs || 27053522 markings, 40715488 edges, 243177 markings/sec, 105 secs
lola: sara is running 110 secs || 28281413 markings, 42563463 edges, 245578 markings/sec, 110 secs
lola: sara is running 115 secs || 29356220 markings, 44181042 edges, 214961 markings/sec, 115 secs
lola: sara is running 120 secs || 30364258 markings, 45698124 edges, 201608 markings/sec, 120 secs
lola: sara is running 125 secs || 31038087 markings, 46712255 edges, 134766 markings/sec, 125 secs
lola: sara is running 130 secs || 31468649 markings, 47360191 edges, 86112 markings/sec, 130 secs
lola: sara is running 135 secs || 31468649 markings, 47360191 edges, 0 markings/sec, 135 secs
lola: sara is running 140 secs || 31557227 markings, 47493543 edges, 17716 markings/sec, 140 secs
lola: sara is running 145 secs || 32575844 markings, 49026532 edges, 203723 markings/sec, 145 secs
lola: sara is running 150 secs || 33354725 markings, 50198771 edges, 155776 markings/sec, 150 secs
lola: sara is running 155 secs || 33354725 markings, 50198771 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 33357692 markings, 50203279 edges, 593 markings/sec, 160 secs
lola: sara is running 165 secs || 33890222 markings, 51004672 edges, 106506 markings/sec, 165 secs
lola: sara is running 170 secs || 33938180 markings, 51076826 edges, 9592 markings/sec, 170 secs
lola: sara is running 175 secs || 34494391 markings, 51913956 edges, 111242 markings/sec, 175 secs
lola: sara is running 180 secs || 34844331 markings, 52440648 edges, 69988 markings/sec, 180 secs
lola: sara is running 185 secs || 34901583 markings, 52526815 edges, 11450 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E(((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302)))
lola: processed formula length: 66
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 101 markings, 202 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p263) OR E (X (E (((1 <= p437) U (1 <= p495))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p263)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p263)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (((1 <= p437) U (1 <= p495)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((1 <= p437) U (1 <= p495)))))
lola: processed formula length: 39
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EXEU)
lola: state space: using reachability graph (EXEU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p495)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 1384447 markings, 2083512 edges, 276889 markings/sec, 0 secs
lola: sara is running 5 secs || 2721683 markings, 4096026 edges, 267447 markings/sec, 5 secs
lola: sara is running 10 secs || 4069100 markings, 6123938 edges, 269483 markings/sec, 10 secs
lola: sara is running 15 secs || 5412723 markings, 8146041 edges, 268725 markings/sec, 15 secs
lola: sara is running 20 secs || 6738820 markings, 10141813 edges, 265219 markings/sec, 20 secs
lola: sara is running 25 secs || 8087471 markings, 12171588 edges, 269730 markings/sec, 25 secs
lola: sara is running 30 secs || 9426315 markings, 14186545 edges, 267769 markings/sec, 30 secs
lola: sara is running 35 secs || 10748167 markings, 16175920 edges, 264370 markings/sec, 35 secs
lola: sara is running 40 secs || 12078971 markings, 18178816 edges, 266161 markings/sec, 40 secs
lola: sara is running 45 secs || 13400083 markings, 20167044 edges, 264222 markings/sec, 45 secs
lola: sara is running 50 secs || 14714413 markings, 22145111 edges, 262866 markings/sec, 50 secs
lola: sara is running 55 secs || 16036887 markings, 24135433 edges, 264495 markings/sec, 55 secs
lola: sara is running 60 secs || 17354340 markings, 26118149 edges, 263491 markings/sec, 60 secs
lola: sara is running 65 secs || 18672734 markings, 28102397 edges, 263679 markings/sec, 65 secs
lola: sara is running 70 secs || 19988898 markings, 30083220 edges, 263233 markings/sec, 70 secs
lola: sara is running 75 secs || 21301055 markings, 32058013 edges, 262431 markings/sec, 75 secs
lola: sara is running 80 secs || 22613125 markings, 34032683 edges, 262414 markings/sec, 80 secs
lola: sara is running 85 secs || 23922773 markings, 36003635 edges, 261930 markings/sec, 85 secs
lola: sara is running 90 secs || 25241382 markings, 37988187 edges, 263722 markings/sec, 90 secs
lola: sara is running 95 secs || 26543415 markings, 39947807 edges, 260407 markings/sec, 95 secs
lola: sara is running 100 secs || 27838832 markings, 41897330 edges, 259083 markings/sec, 100 secs
lola: sara is running 105 secs || 29043083 markings, 43709734 edges, 240850 markings/sec, 105 secs
lola: sara is running 110 secs || 29847720 markings, 44920752 edges, 160927 markings/sec, 110 secs
lola: sara is running 115 secs || 31055313 markings, 46738188 edges, 241519 markings/sec, 115 secs
lola: sara is running 120 secs || 32014744 markings, 48182090 edges, 191886 markings/sec, 120 secs
lola: sara is running 125 secs || 33258789 markings, 50054382 edges, 248809 markings/sec, 125 secs
lola: sara is running 130 secs || 33723134 markings, 50753235 edges, 92869 markings/sec, 130 secs
lola: sara is running 135 secs || 33774088 markings, 50829856 edges, 10191 markings/sec, 135 secs
lola: sara is running 140 secs || 34284204 markings, 51597607 edges, 102023 markings/sec, 140 secs
lola: sara is running 145 secs || 34839501 markings, 52433363 edges, 111059 markings/sec, 145 secs
lola: sara is running 150 secs || 35750482 markings, 53804350 edges, 182196 markings/sec, 150 secs
lola: sara is running 155 secs || 35753985 markings, 53809638 edges, 701 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 7 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p355)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p355)))
lola: processed formula length: 19
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p355)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 8 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p451) AND (1 <= p452) AND (1 <= p454))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p451) AND (1 <= p452) AND (1 <= p454))))
lola: processed formula length: 53
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p451) AND (1 <= p452) AND (1 <= p454))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p255 <= 0) AND A (G ((1 <= p495)))) U A (G ((p235 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p255 <= 0) AND AG((1 <= p495))) U AG((p235 <= 0)))
lola: processed formula length: 54
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1501252 markings, 2259308 edges, 300250 markings/sec, 0 secs
lola: 2948743 markings, 4437738 edges, 289498 markings/sec, 5 secs
lola: 4362277 markings, 6565150 edges, 282707 markings/sec, 10 secs
lola: 5797363 markings, 8724976 edges, 287017 markings/sec, 15 secs
lola: 7218211 markings, 10863306 edges, 284170 markings/sec, 20 secs
lola: 8610622 markings, 12958943 edges, 278482 markings/sec, 25 secs
lola: 10019384 markings, 15079135 edges, 281752 markings/sec, 30 secs
lola: 11431556 markings, 17204395 edges, 282434 markings/sec, 35 secs
lola: 12813779 markings, 19284657 edges, 276445 markings/sec, 40 secs
lola: 14202362 markings, 21374497 edges, 277717 markings/sec, 45 secs
lola: 15580461 markings, 23448508 edges, 275620 markings/sec, 50 secs
lola: 16962810 markings, 25528924 edges, 276470 markings/sec, 55 secs
lola: 18345450 markings, 27609858 edges, 276528 markings/sec, 60 secs
lola: 19716171 markings, 29672726 edges, 274144 markings/sec, 65 secs
lola: 21085093 markings, 31732948 edges, 273784 markings/sec, 70 secs
lola: 22454944 markings, 33794622 edges, 273970 markings/sec, 75 secs
lola: 23816400 markings, 35843586 edges, 272291 markings/sec, 80 secs
lola: 25200594 markings, 37926797 edges, 276839 markings/sec, 85 secs
lola: 26523925 markings, 39918478 edges, 264666 markings/sec, 90 secs
lola: 27465847 markings, 41336124 edges, 188384 markings/sec, 95 secs
lola: 28558465 markings, 42980892 edges, 218524 markings/sec, 100 secs
lola: 29779371 markings, 44818513 edges, 244181 markings/sec, 105 secs
lola: 31010540 markings, 46670792 edges, 246234 markings/sec, 110 secs
lola: 31041966 markings, 46718078 edges, 6285 markings/sec, 115 secs
lola: 31041966 markings, 46718078 edges, 0 markings/sec, 120 secs
lola: 32127489 markings, 48351782 edges, 217105 markings/sec, 125 secs
lola: 32313346 markings, 48631514 edges, 37171 markings/sec, 130 secs
lola: 32313346 markings, 48631514 edges, 0 markings/sec, 135 secs
lola: 32313346 markings, 48631514 edges, 0 markings/sec, 140 secs
lola: 32316276 markings, 48635899 edges, 586 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((p250 <= 0))) U A (F (((1 <= p426) AND (1 <= p427) AND (1 <= p429))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AG((p250 <= 0)) U AF(((1 <= p426) AND (1 <= p427) AND (1 <= p429))))
lola: processed formula length: 70
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1466051 markings, 2206431 edges, 293210 markings/sec, 0 secs
lola: 2869610 markings, 4318787 edges, 280712 markings/sec, 5 secs
lola: 4279238 markings, 6440285 edges, 281926 markings/sec, 10 secs
lola: 5681005 markings, 8549919 edges, 280353 markings/sec, 15 secs
lola: 7084357 markings, 10661981 edges, 280670 markings/sec, 20 secs
lola: 8543506 markings, 12857993 edges, 291830 markings/sec, 25 secs
lola: 9932717 markings, 14948789 edges, 277842 markings/sec, 30 secs
lola: 11341204 markings, 17068505 edges, 281697 markings/sec, 35 secs
lola: 12754809 markings, 19196007 edges, 282721 markings/sec, 40 secs
lola: 14140219 markings, 21281094 edges, 277082 markings/sec, 45 secs
lola: 15513925 markings, 23348422 edges, 274741 markings/sec, 50 secs
lola: 16893205 markings, 25424319 edges, 275856 markings/sec, 55 secs
lola: 18269165 markings, 27495085 edges, 275192 markings/sec, 60 secs
lola: 19639657 markings, 29557690 edges, 274098 markings/sec, 65 secs
lola: 21020340 markings, 31635644 edges, 276137 markings/sec, 70 secs
lola: 22393408 markings, 33702071 edges, 274614 markings/sec, 75 secs
lola: 23752470 markings, 35747439 edges, 271812 markings/sec, 80 secs
lola: 25147041 markings, 37846292 edges, 278914 markings/sec, 85 secs
lola: 26441321 markings, 39794511 edges, 258856 markings/sec, 90 secs
lola: 27432292 markings, 41285585 edges, 198194 markings/sec, 95 secs
lola: 28483564 markings, 42867797 edges, 210254 markings/sec, 100 secs
lola: 29661854 markings, 44641111 edges, 235658 markings/sec, 105 secs
lola: 30887494 markings, 46485718 edges, 245128 markings/sec, 110 secs
lola: 31566806 markings, 47508041 edges, 135862 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((E (F ((1 <= p58))) OR ((p153 <= 0) OR (p3 <= 2))) U (A (G (((1 <= p291) AND (1 <= p292) AND (1 <= p294)))) AND ((p430 <= 0) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EF((1 <= p58)) OR ((p153 <= 0) OR (p3 <= 2))) U (AG(((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND ((p430 <= 0) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0)))))
lola: processed formula length: 171
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1454734 markings, 2189280 edges, 290947 markings/sec, 0 secs
lola: 2853135 markings, 4293869 edges, 279680 markings/sec, 5 secs
lola: 4259077 markings, 6409832 edges, 281188 markings/sec, 10 secs
lola: 5654268 markings, 8509588 edges, 279038 markings/sec, 15 secs
lola: 7040197 markings, 10595399 edges, 277186 markings/sec, 20 secs
lola: 8462294 markings, 12735671 edges, 284419 markings/sec, 25 secs
lola: 9872892 markings, 14858637 edges, 282120 markings/sec, 30 secs
lola: 11254287 markings, 16937584 edges, 276279 markings/sec, 35 secs
lola: 12648170 markings, 19035441 edges, 278777 markings/sec, 40 secs
lola: 14031031 markings, 21116603 edges, 276572 markings/sec, 45 secs
lola: 15398046 markings, 23173971 edges, 273403 markings/sec, 50 secs
lola: 16790633 markings, 25269874 edges, 278517 markings/sec, 55 secs
lola: 18177167 markings, 27356601 edges, 277307 markings/sec, 60 secs
lola: 19546043 markings, 29416692 edges, 273775 markings/sec, 65 secs
lola: 20921818 markings, 31487228 edges, 275155 markings/sec, 70 secs
lola: 22295401 markings, 33554502 edges, 274717 markings/sec, 75 secs
lola: 23647614 markings, 35589553 edges, 270443 markings/sec, 80 secs
lola: 25038014 markings, 37682118 edges, 278080 markings/sec, 85 secs
lola: 26395773 markings, 39725602 edges, 271552 markings/sec, 90 secs
lola: 27383532 markings, 41212181 edges, 197552 markings/sec, 95 secs
lola: 28424177 markings, 42782420 edges, 208129 markings/sec, 100 secs
lola: 29642733 markings, 44612233 edges, 243711 markings/sec, 105 secs
lola: 30853291 markings, 46434153 edges, 242112 markings/sec, 110 secs
lola: 32031741 markings, 48207704 edges, 235690 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p441) AND (1 <= p442) AND (1 <= p444)) OR ((1 <= p256) AND (1 <= p257) AND (1 <= p259))))) AND (p250 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p250 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p250 <= 0)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 717 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p441) AND (1 <= p442) AND (1 <= p444)) OR ((1 <= p256) AND (1 <= p257) AND (1 <= p259)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p441) AND (1 <= p442) AND (1 <= p444)) OR ((1 <= p256) AND (1 <= p257) AND (1 <= p259)))))
lola: processed formula length: 105
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p441) AND (1 <= p442) AND (1 <= p444)) OR ((1 <= p256) AND (1 <= p257) AND (1 <= p259)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
sara: try reading problem file CTLFireability-13-0.sara.
lola: subprocess 13 will run for 716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p390 <= 0) U ((1 <= p112) OR ((1 <= p196) AND (1 <= p197) AND (1 <= p199)))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p390 <= 0) U ((1 <= p112) OR ((1 <= p196) AND (1 <= p197) AND (1 <= p199)))))
lola: processed formula length: 83
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 704912 markings, 1402786 edges
lola: subprocess 14 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((p480 <= 0))) OR ((1 <= p437) AND (1 <= p502) AND (1 <= p132) AND (1 <= p68) AND (1 <= p253)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p480 <= 0)) OR ((1 <= p437) AND (1 <= p502) AND (1 <= p132) AND (1 <= p68) AND (1 <= p253))))
lola: processed formula length: 101
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 440 markings, 561 edges
lola: ========================================
lola: subprocess 15 will run for 2147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p67 <= 0))) AND (E (G ((1 <= p422))) OR (E (F ((p128 <= 0))) AND ((1 <= p8) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p8) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0)))
lola: processed formula length: 71
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p67 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p67 <= 0)))
lola: processed formula length: 18
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p67 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p238 <= 0))) U A (((1 <= p72) U (1 <= p195)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((p238 <= 0)) U A((1 <= p72) U (1 <= p195)))
lola: processed formula length: 48
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 627299 markings, 2198404 edges, 125460 markings/sec, 0 secs
lola: 1249964 markings, 4381047 edges, 124533 markings/sec, 5 secs
lola: 1856138 markings, 6505727 edges, 121235 markings/sec, 10 secs
lola: 2461883 markings, 8628799 edges, 121149 markings/sec, 15 secs
lola: 3066736 markings, 10748810 edges, 120971 markings/sec, 20 secs
lola: 3677583 markings, 12889862 edges, 122169 markings/sec, 25 secs
lola: 4283713 markings, 15014163 edges, 121226 markings/sec, 30 secs
lola: 4885496 markings, 17123538 edges, 120357 markings/sec, 35 secs
lola: 5495482 markings, 19261412 edges, 121997 markings/sec, 40 secs
lola: 6096540 markings, 21368335 edges, 120212 markings/sec, 45 secs
lola: 6695932 markings, 23469104 edges, 119878 markings/sec, 50 secs
lola: 7300526 markings, 25588167 edges, 120919 markings/sec, 55 secs
lola: 7909413 markings, 27722385 edges, 121777 markings/sec, 60 secs
lola: 8515007 markings, 29844982 edges, 121119 markings/sec, 65 secs
lola: 9117573 markings, 31956954 edges, 120513 markings/sec, 70 secs
lola: 9726054 markings, 34089732 edges, 121696 markings/sec, 75 secs
lola: 10329655 markings, 36205392 edges, 120720 markings/sec, 80 secs
lola: 10925675 markings, 38294220 edges, 119204 markings/sec, 85 secs
lola: 11529857 markings, 40411964 edges, 120836 markings/sec, 90 secs
lola: 12131274 markings, 42520039 edges, 120283 markings/sec, 95 secs
lola: 12732161 markings, 44626100 edges, 120177 markings/sec, 100 secs
lola: 13331943 markings, 46728329 edges, 119956 markings/sec, 105 secs
lola: 13934896 markings, 48841738 edges, 120591 markings/sec, 110 secs
lola: 14531829 markings, 50933993 edges, 119387 markings/sec, 115 secs
lola: 15117460 markings, 52986643 edges, 117126 markings/sec, 120 secs
lola: 15712067 markings, 55070689 edges, 118921 markings/sec, 125 secs
lola: 16224540 markings, 56866916 edges, 102495 markings/sec, 130 secs
lola: 16704695 markings, 58549991 edges, 96031 markings/sec, 135 secs
lola: 17246789 markings, 60449843 edges, 108419 markings/sec, 140 secs
lola: 17747665 markings, 62205475 edges, 100175 markings/sec, 145 secs
lola: 18295187 markings, 64124465 edges, 109504 markings/sec, 150 secs
lola: 18842319 markings, 66042237 edges, 109426 markings/sec, 155 secs
lola: 19328269 markings, 67745379 edges, 97190 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p90 <= 0) AND E (F (A (X (((1 <= p250) AND (1 <= p40)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p90 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p90 <= 0)
lola: processed formula length: 10
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p250) AND (1 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: ========================================
lola: processed formula: EF(AX(((1 <= p250) AND (1 <= p40))))
lola: processed formula length: 36
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1224333 markings, 1842573 edges, 244867 markings/sec, 0 secs
lola: 2398924 markings, 3610304 edges, 234918 markings/sec, 5 secs
lola: 3578763 markings, 5385932 edges, 235968 markings/sec, 10 secs
lola: 4742523 markings, 7137400 edges, 232752 markings/sec, 15 secs
lola: 5919572 markings, 8908904 edges, 235410 markings/sec, 20 secs
lola: 7078603 markings, 10653203 edges, 231806 markings/sec, 25 secs
lola: 8258120 markings, 12428420 edges, 235903 markings/sec, 30 secs
lola: 9429943 markings, 14191982 edges, 234365 markings/sec, 35 secs
lola: 10585845 markings, 15931645 edges, 231180 markings/sec, 40 secs
lola: 11753591 markings, 17689099 edges, 233549 markings/sec, 45 secs
lola: 12905403 markings, 19422539 edges, 230362 markings/sec, 50 secs
lola: 14064723 markings, 21167310 edges, 231864 markings/sec, 55 secs
lola: 15206125 markings, 22885124 edges, 228280 markings/sec, 60 secs
lola: 16196487 markings, 24375727 edges, 198072 markings/sec, 65 secs
lola: 17045719 markings, 25653816 edges, 169846 markings/sec, 70 secs
lola: 17848015 markings, 26861364 edges, 160459 markings/sec, 75 secs
lola: 18848974 markings, 28367685 edges, 200192 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p93) OR A (X (E (F ((((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR (1 <= p173)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p93)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p93)
lola: processed formula length: 10
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR (1 <= p173))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR (1 <= p173))))
lola: processed formula length: 71
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1408735 markings, 2120101 edges, 281747 markings/sec, 0 secs
lola: 2751310 markings, 4140636 edges, 268515 markings/sec, 5 secs
lola: 4114879 markings, 6192827 edges, 272714 markings/sec, 10 secs
lola: 5474718 markings, 8239335 edges, 271968 markings/sec, 15 secs
lola: 6783248 markings, 10208663 edges, 261706 markings/sec, 20 secs
lola: 8124941 markings, 12227953 edges, 268339 markings/sec, 25 secs
lola: 9475392 markings, 14260364 edges, 270090 markings/sec, 30 secs
lola: 10785116 markings, 16231499 edges, 261945 markings/sec, 35 secs
lola: 12092055 markings, 18198458 edges, 261388 markings/sec, 40 secs
lola: 13387710 markings, 20148407 edges, 259131 markings/sec, 45 secs
lola: 14664662 markings, 22070241 edges, 255390 markings/sec, 50 secs
lola: 15973332 markings, 24039813 edges, 261734 markings/sec, 55 secs
lola: 17346602 markings, 26106534 edges, 274654 markings/sec, 60 secs
lola: 18727701 markings, 28185125 edges, 276220 markings/sec, 65 secs
lola: 20099822 markings, 30250171 edges, 274424 markings/sec, 70 secs
lola: 21466254 markings, 32306602 edges, 273286 markings/sec, 75 secs
lola: 22835071 markings, 34366727 edges, 273763 markings/sec, 80 secs
lola: 24211044 markings, 36437518 edges, 275195 markings/sec, 85 secs
lola: 25588175 markings, 38510115 edges, 275426 markings/sec, 90 secs
lola: 26693613 markings, 40173833 edges, 221088 markings/sec, 95 secs
lola: 27656194 markings, 41622485 edges, 192516 markings/sec, 100 secs
lola: 28784902 markings, 43321200 edges, 225742 markings/sec, 105 secs
lola: 29992052 markings, 45137941 edges, 241430 markings/sec, 110 secs
lola: 31180223 markings, 46926132 edges, 237634 markings/sec, 115 secs
lola: 32371161 markings, 48718489 edges, 238188 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (E ((((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302))))) AND (E (((p453 <= 0) U ((1 <= p391) AND (1 <= p392) AND (1 <= p394)))) OR ((1 <= p208) AND (E (X ((1 <= p138))) OR A (F ((1 <= p292)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p292)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p292 <= 0)
lola: processed formula length: 11
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p292)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: (1 <= p208)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p208)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((p453 <= 0) U ((1 <= p391) AND (1 <= p392) AND (1 <= p394))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p453 <= 0) U ((1 <= p391) AND (1 <= p392) AND (1 <= p394))))
lola: processed formula length: 65
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: ========================================
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p391) AND (1 <= p392) AND (1 <= p394))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-21-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-21-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 1235065 markings, 1858665 edges, 247013 markings/sec, 0 secs
lola: sara is running 5 secs || 2446830 markings, 3682449 edges, 242353 markings/sec, 5 secs
lola: sara is running 10 secs || 3686335 markings, 5547859 edges, 247901 markings/sec, 10 secs
lola: sara is running 15 secs || 4916341 markings, 7399016 edges, 246001 markings/sec, 15 secs
lola: sara is running 20 secs || 6148369 markings, 9253206 edges, 246406 markings/sec, 20 secs
lola: sara is running 25 secs || 7377018 markings, 11102312 edges, 245730 markings/sec, 25 secs
lola: sara is running 30 secs || 8606701 markings, 12953003 edges, 245937 markings/sec, 30 secs
lola: sara is running 35 secs || 9839137 markings, 14807806 edges, 246487 markings/sec, 35 secs
lola: sara is running 40 secs || 11059505 markings, 16644502 edges, 244074 markings/sec, 40 secs
lola: sara is running 45 secs || 12289626 markings, 18495812 edges, 246024 markings/sec, 45 secs
lola: sara is running 50 secs || 13513369 markings, 20337519 edges, 244749 markings/sec, 50 secs
lola: sara is running 55 secs || 14725222 markings, 22161398 edges, 242371 markings/sec, 55 secs
lola: sara is running 60 secs || 15947742 markings, 24001262 edges, 244504 markings/sec, 60 secs
lola: sara is running 65 secs || 17162124 markings, 25828933 edges, 242876 markings/sec, 65 secs
lola: sara is running 70 secs || 18378483 markings, 27659538 edges, 243272 markings/sec, 70 secs
lola: sara is running 75 secs || 19584549 markings, 29474657 edges, 241213 markings/sec, 75 secs
lola: sara is running 80 secs || 20797487 markings, 31300143 edges, 242588 markings/sec, 80 secs
lola: sara is running 85 secs || 22011705 markings, 33127544 edges, 242844 markings/sec, 85 secs
lola: sara is running 90 secs || 23211570 markings, 34933319 edges, 239973 markings/sec, 90 secs
lola: sara is running 95 secs || 24434333 markings, 36773603 edges, 244553 markings/sec, 95 secs
lola: sara is running 100 secs || 25653111 markings, 38607795 edges, 243756 markings/sec, 100 secs
lola: sara is running 105 secs || 26873392 markings, 40444375 edges, 244056 markings/sec, 105 secs
lola: sara is running 110 secs || 28090293 markings, 42275806 edges, 243380 markings/sec, 110 secs
lola: sara is running 115 secs || 29185321 markings, 43923806 edges, 219006 markings/sec, 115 secs
lola: sara is running 120 secs || 30169049 markings, 45404313 edges, 196746 markings/sec, 120 secs
lola: sara is running 125 secs || 31316827 markings, 47131768 edges, 229556 markings/sec, 125 secs
lola: sara is running 130 secs || 32336794 markings, 48666810 edges, 203993 markings/sec, 130 secs
lola: sara is running 135 secs || 33097614 markings, 49811814 edges, 152164 markings/sec, 135 secs
lola: sara is running 140 secs || 34191812 markings, 51458567 edges, 218840 markings/sec, 140 secs
lola: sara is running 145 secs || 34553384 markings, 52002728 edges, 72314 markings/sec, 145 secs
lola: sara is running 150 secs || 34826815 markings, 52414322 edges, 54686 markings/sec, 150 secs
lola: sara is running 155 secs || 35795517 markings, 53872100 edges, 193740 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E ((((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E(((1 <= p166) AND (1 <= p167) AND (1 <= p169)) U (1 <= p302)))
lola: processed formula length: 66
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 101 markings, 202 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p263) OR E (X (E (((1 <= p437) U (1 <= p495))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p263)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p263)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X (E (((1 <= p437) U (1 <= p495)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((1 <= p437) U (1 <= p495)))))
lola: processed formula length: 39
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EXEU)
lola: state space: using reachability graph (EXEU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p495)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-21-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-21-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 1375968 markings, 2070725 edges, 275194 markings/sec, 0 secs
lola: sara is running 5 secs || 2709780 markings, 4078142 edges, 266762 markings/sec, 5 secs
lola: sara is running 10 secs || 4050483 markings, 6095914 edges, 268141 markings/sec, 10 secs
lola: sara is running 15 secs || 5385456 markings, 8105032 edges, 266995 markings/sec, 15 secs
lola: sara is running 20 secs || 6704418 markings, 10090062 edges, 263792 markings/sec, 20 secs
lola: sara is running 25 secs || 8040910 markings, 12101494 edges, 267298 markings/sec, 25 secs
lola: sara is running 30 secs || 9377380 markings, 14112837 edges, 267294 markings/sec, 30 secs
lola: sara is running 35 secs || 10697347 markings, 16099433 edges, 263993 markings/sec, 35 secs
lola: sara is running 40 secs || 12026738 markings, 18100137 edges, 265878 markings/sec, 40 secs
lola: sara is running 45 secs || 13342870 markings, 20080946 edges, 263226 markings/sec, 45 secs
lola: sara is running 50 secs || 14654671 markings, 22055218 edges, 262360 markings/sec, 50 secs
lola: sara is running 55 secs || 15973245 markings, 24039643 edges, 263715 markings/sec, 55 secs
lola: sara is running 60 secs || 17284848 markings, 26013583 edges, 262321 markings/sec, 60 secs
lola: sara is running 65 secs || 18602338 markings, 27996462 edges, 263498 markings/sec, 65 secs
lola: sara is running 70 secs || 19916584 markings, 29974389 edges, 262849 markings/sec, 70 secs
lola: sara is running 75 secs || 21222911 markings, 31940409 edges, 261265 markings/sec, 75 secs
lola: sara is running 80 secs || 22533448 markings, 33912745 edges, 262107 markings/sec, 80 secs
lola: sara is running 85 secs || 23838126 markings, 35876233 edges, 260936 markings/sec, 85 secs
lola: sara is running 90 secs || 25155730 markings, 37859307 edges, 263521 markings/sec, 90 secs
lola: sara is running 95 secs || 26475082 markings, 39844913 edges, 263870 markings/sec, 95 secs
lola: sara is running 100 secs || 27780501 markings, 41809532 edges, 261084 markings/sec, 100 secs
lola: sara is running 105 secs || 29035787 markings, 43698769 edges, 251057 markings/sec, 105 secs
lola: sara is running 110 secs || 30106909 markings, 45310801 edges, 214224 markings/sec, 110 secs
lola: sara is running 115 secs || 31251273 markings, 47033083 edges, 228873 markings/sec, 115 secs
lola: sara is running 120 secs || 32444496 markings, 48828866 edges, 238645 markings/sec, 120 secs
lola: sara is running 125 secs || 33663481 markings, 50663478 edges, 243797 markings/sec, 125 secs
lola: sara is running 130 secs || 34805501 markings, 52382201 edges, 228404 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p255 <= 0) AND A (G ((1 <= p495)))) U A (G ((p235 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p255 <= 0) AND AG((1 <= p495))) U AG((p235 <= 0)))
lola: processed formula length: 54
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1450632 markings, 2183126 edges, 290126 markings/sec, 0 secs
lola: 2846524 markings, 4283901 edges, 279178 markings/sec, 5 secs
lola: 4252251 markings, 6399562 edges, 281145 markings/sec, 10 secs
lola: 5646407 markings, 8497740 edges, 278831 markings/sec, 15 secs
lola: 7023799 markings, 10570718 edges, 275478 markings/sec, 20 secs
lola: 8426345 markings, 12681592 edges, 280509 markings/sec, 25 secs
lola: 9823548 markings, 14784318 edges, 279441 markings/sec, 30 secs
lola: 11198098 markings, 16853063 edges, 274910 markings/sec, 35 secs
lola: 12588416 markings, 18945537 edges, 278064 markings/sec, 40 secs
lola: 13969229 markings, 21023589 edges, 276163 markings/sec, 45 secs
lola: 15333052 markings, 23076125 edges, 272765 markings/sec, 50 secs
lola: 16720091 markings, 25163641 edges, 277408 markings/sec, 55 secs
lola: 18104308 markings, 27246886 edges, 276843 markings/sec, 60 secs
lola: 19466975 markings, 29297710 edges, 272533 markings/sec, 65 secs
lola: 20848997 markings, 31377694 edges, 276404 markings/sec, 70 secs
lola: 22219791 markings, 33440739 edges, 274159 markings/sec, 75 secs
lola: 23572946 markings, 35477161 edges, 270631 markings/sec, 80 secs
lola: 24964009 markings, 37570750 edges, 278213 markings/sec, 85 secs
lola: 26334671 markings, 39633718 edges, 274132 markings/sec, 90 secs
lola: 27330358 markings, 41132228 edges, 199137 markings/sec, 95 secs
lola: 28351325 markings, 42668727 edges, 204193 markings/sec, 100 secs
lola: 29513900 markings, 44418414 edges, 232515 markings/sec, 105 secs
lola: 30729615 markings, 46248124 edges, 243143 markings/sec, 110 secs
lola: 31966148 markings, 48108990 edges, 247307 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((A (G ((p250 <= 0))) U A (F (((1 <= p426) AND (1 <= p427) AND (1 <= p429))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AG((p250 <= 0)) U AF(((1 <= p426) AND (1 <= p427) AND (1 <= p429))))
lola: processed formula length: 70
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1452388 markings, 2185893 edges, 290478 markings/sec, 0 secs
lola: 2850351 markings, 4289776 edges, 279593 markings/sec, 5 secs
lola: 4257539 markings, 6407649 edges, 281438 markings/sec, 10 secs
lola: 5646695 markings, 8498319 edges, 277831 markings/sec, 15 secs
lola: 7026529 markings, 10574921 edges, 275967 markings/sec, 20 secs
lola: 8427838 markings, 12683973 edges, 280262 markings/sec, 25 secs
lola: 9825517 markings, 14787419 edges, 279536 markings/sec, 30 secs
lola: 11200888 markings, 16857382 edges, 275074 markings/sec, 35 secs
lola: 12592919 markings, 18952386 edges, 278406 markings/sec, 40 secs
lola: 13965800 markings, 21018516 edges, 274576 markings/sec, 45 secs
lola: 15331168 markings, 23073399 edges, 273074 markings/sec, 50 secs
lola: 16719562 markings, 25162963 edges, 277679 markings/sec, 55 secs
lola: 18105375 markings, 27248574 edges, 277163 markings/sec, 60 secs
lola: 19467211 markings, 29298148 edges, 272367 markings/sec, 65 secs
lola: 20845177 markings, 31372036 edges, 275593 markings/sec, 70 secs
lola: 22213848 markings, 33431845 edges, 273734 markings/sec, 75 secs
lola: 23567824 markings, 35469565 edges, 270795 markings/sec, 80 secs
lola: 24956923 markings, 37560210 edges, 277820 markings/sec, 85 secs
lola: 26318875 markings, 39609940 edges, 272390 markings/sec, 90 secs
lola: 27265300 markings, 41034452 edges, 189285 markings/sec, 95 secs
lola: 28270594 markings, 42547710 edges, 201059 markings/sec, 100 secs
lola: 29420649 markings, 44278110 edges, 230011 markings/sec, 105 secs
lola: 30662184 markings, 46146648 edges, 248307 markings/sec, 110 secs
lola: 31873995 markings, 47970366 edges, 242362 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (((E (F ((1 <= p58))) OR ((p153 <= 0) OR (p3 <= 2))) U (A (G (((1 <= p291) AND (1 <= p292) AND (1 <= p294)))) AND ((p430 <= 0) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EF((1 <= p58)) OR ((p153 <= 0) OR (p3 <= 2))) U (AG(((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND ((p430 <= 0) AND ((p151 <= 0) OR (p152 <= 0) OR (p154 <= 0)))))
lola: processed formula length: 171
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1451210 markings, 2184008 edges, 290242 markings/sec, 0 secs
lola: 2866253 markings, 4313584 edges, 283009 markings/sec, 5 secs
lola: 4278061 markings, 6438393 edges, 282362 markings/sec, 10 secs
lola: 5683058 markings, 8552924 edges, 280999 markings/sec, 15 secs
lola: 7068463 markings, 10637906 edges, 277081 markings/sec, 20 secs
lola: 8493892 markings, 12783256 edges, 285086 markings/sec, 25 secs
lola: 9907541 markings, 14910764 edges, 282730 markings/sec, 30 secs
lola: 11301441 markings, 17008582 edges, 278780 markings/sec, 35 secs
lola: 12701391 markings, 19115509 edges, 279990 markings/sec, 40 secs
lola: 14092868 markings, 21209685 edges, 278295 markings/sec, 45 secs
lola: 15470958 markings, 23283693 edges, 275618 markings/sec, 50 secs
lola: 16864183 markings, 25380524 edges, 278645 markings/sec, 55 secs
lola: 18253025 markings, 27470696 edges, 277768 markings/sec, 60 secs
lola: 19629488 markings, 29542278 edges, 275293 markings/sec, 65 secs
lola: 21006558 markings, 31614790 edges, 275414 markings/sec, 70 secs
lola: 22378746 markings, 33679964 edges, 274438 markings/sec, 75 secs
lola: 23739502 markings, 35727820 edges, 272151 markings/sec, 80 secs
lola: 25113544 markings, 37795799 edges, 274808 markings/sec, 85 secs
lola: 26438360 markings, 39789797 edges, 264963 markings/sec, 90 secs
lola: 27359800 markings, 41176981 edges, 184288 markings/sec, 95 secs
lola: 28351908 markings, 42669645 edges, 198422 markings/sec, 100 secs
lola: 29549443 markings, 44471791 edges, 239507 markings/sec, 105 secs
lola: 30759571 markings, 46293089 edges, 242026 markings/sec, 110 secs
lola: 31956526 markings, 48094435 edges, 239391 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F ((p67 <= 0))) AND (E (G ((1 <= p422))) OR (E (F ((p128 <= 0))) AND ((1 <= p8) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p8) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p115 <= 0)))
lola: processed formula length: 71
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p422)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p422)))
lola: processed formula length: 19
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p422 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((p67 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p67 <= 0)))
lola: processed formula length: 18
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p67 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown yes unknown unknown yes yes unknown unknown no yes no no unknown yes unknown unknown
lola:
preliminary result: unknown yes unknown unknown yes yes unknown unknown no yes no no unknown yes unknown unknown
lola: memory consumption: 4060 KB
lola: time consumption: 2500 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

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

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="RefineWMG-PT-100100"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is RefineWMG-PT-100100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;