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-158987938500122.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-100101, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 3.0K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.4K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 RefineWMG-PT-100101-00
FORMULA_NAME RefineWMG-PT-100101-01
FORMULA_NAME RefineWMG-PT-100101-02
FORMULA_NAME RefineWMG-PT-100101-03
FORMULA_NAME RefineWMG-PT-100101-04
FORMULA_NAME RefineWMG-PT-100101-05
FORMULA_NAME RefineWMG-PT-100101-06
FORMULA_NAME RefineWMG-PT-100101-07
FORMULA_NAME RefineWMG-PT-100101-08
FORMULA_NAME RefineWMG-PT-100101-09
FORMULA_NAME RefineWMG-PT-100101-10
FORMULA_NAME RefineWMG-PT-100101-11
FORMULA_NAME RefineWMG-PT-100101-12
FORMULA_NAME RefineWMG-PT-100101-13
FORMULA_NAME RefineWMG-PT-100101-14
FORMULA_NAME RefineWMG-PT-100101-15

=== Now, execution of the tool begins

BK_START 1591228158558

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:49:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:49:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:49:23] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2020-06-03 23:49:23] [INFO ] Transformed 504 places.
[2020-06-03 23:49:23] [INFO ] Transformed 403 transitions.
[2020-06-03 23:49:23] [INFO ] Parsed PT model containing 504 places and 403 transitions in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 74 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100010 steps, including 0 resets, run finished after 501 ms. (steps per millisecond=199 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1]
// Phase 1: matrix 403 rows 504 cols
[2020-06-03 23:49:24] [INFO ] Computed 202 place invariants in 17 ms
[2020-06-03 23:49:28] [INFO ] [Real]Absence check using 202 positive place invariants in 3996 ms returned sat
[2020-06-03 23:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:29] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2020-06-03 23:49:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:29] [INFO ] [Nat]Absence check using 202 positive place invariants in 142 ms returned sat
[2020-06-03 23:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:30] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2020-06-03 23:49:30] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 64 ms.
[2020-06-03 23:49:31] [INFO ] Added : 58 causal constraints over 12 iterations in 627 ms. Result :sat
[2020-06-03 23:49:31] [INFO ] [Real]Absence check using 202 positive place invariants in 145 ms returned sat
[2020-06-03 23:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:32] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2020-06-03 23:49:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:32] [INFO ] [Nat]Absence check using 202 positive place invariants in 174 ms returned sat
[2020-06-03 23:49:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:32] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2020-06-03 23:49:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2020-06-03 23:49:33] [INFO ] Added : 77 causal constraints over 16 iterations in 398 ms. Result :sat
[2020-06-03 23:49:33] [INFO ] [Real]Absence check using 202 positive place invariants in 165 ms returned sat
[2020-06-03 23:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:34] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2020-06-03 23:49:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 121 ms returned sat
[2020-06-03 23:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:35] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2020-06-03 23:49:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 38 ms.
[2020-06-03 23:49:36] [INFO ] Added : 135 causal constraints over 27 iterations in 900 ms. Result :sat
[2020-06-03 23:49:36] [INFO ] [Real]Absence check using 202 positive place invariants in 182 ms returned sat
[2020-06-03 23:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:37] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2020-06-03 23:49:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:38] [INFO ] [Nat]Absence check using 202 positive place invariants in 426 ms returned sat
[2020-06-03 23:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:38] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2020-06-03 23:49:38] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 29 ms.
[2020-06-03 23:49:39] [INFO ] Added : 26 causal constraints over 6 iterations in 182 ms. Result :sat
[2020-06-03 23:49:39] [INFO ] [Real]Absence check using 202 positive place invariants in 100 ms returned sat
[2020-06-03 23:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:42] [INFO ] [Real]Absence check using state equation in 2821 ms returned sat
[2020-06-03 23:49:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 1239 ms returned sat
[2020-06-03 23:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:45] [INFO ] [Nat]Absence check using state equation in 2137 ms returned sat
[2020-06-03 23:49:45] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:49:46] [INFO ] Added : 158 causal constraints over 32 iterations in 764 ms. Result :sat
[2020-06-03 23:49:46] [INFO ] [Real]Absence check using 202 positive place invariants in 389 ms returned sat
[2020-06-03 23:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:47] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2020-06-03 23:49:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:47] [INFO ] [Nat]Absence check using 202 positive place invariants in 74 ms returned sat
[2020-06-03 23:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:48] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2020-06-03 23:49:48] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 44 ms.
[2020-06-03 23:49:48] [INFO ] Added : 22 causal constraints over 5 iterations in 221 ms. Result :sat
[2020-06-03 23:49:48] [INFO ] [Real]Absence check using 202 positive place invariants in 238 ms returned sat
[2020-06-03 23:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:50] [INFO ] [Real]Absence check using state equation in 1775 ms returned sat
[2020-06-03 23:49:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:50] [INFO ] [Nat]Absence check using 202 positive place invariants in 88 ms returned sat
[2020-06-03 23:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:51] [INFO ] [Nat]Absence check using state equation in 1280 ms returned sat
[2020-06-03 23:49:51] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 50 ms.
[2020-06-03 23:49:53] [INFO ] Added : 198 causal constraints over 40 iterations in 1305 ms. Result :sat
[2020-06-03 23:49:53] [INFO ] [Real]Absence check using 202 positive place invariants in 421 ms returned sat
[2020-06-03 23:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:54] [INFO ] [Real]Absence check using state equation in 1136 ms returned sat
[2020-06-03 23:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:55] [INFO ] [Nat]Absence check using 202 positive place invariants in 298 ms returned sat
[2020-06-03 23:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:56] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2020-06-03 23:49:56] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:49:56] [INFO ] Added : 75 causal constraints over 15 iterations in 335 ms. Result :sat
[2020-06-03 23:49:56] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:57] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2020-06-03 23:49:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:57] [INFO ] [Nat]Absence check using 202 positive place invariants in 732 ms returned sat
[2020-06-03 23:49:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:58] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2020-06-03 23:49:58] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 27 ms.
[2020-06-03 23:49:59] [INFO ] Added : 75 causal constraints over 15 iterations in 588 ms. Result :sat
[2020-06-03 23:49:59] [INFO ] [Real]Absence check using 202 positive place invariants in 151 ms returned sat
[2020-06-03 23:49:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:59] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2020-06-03 23:49:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:00] [INFO ] [Nat]Absence check using 202 positive place invariants in 243 ms returned sat
[2020-06-03 23:50:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:00] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2020-06-03 23:50:00] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2020-06-03 23:50:01] [INFO ] Added : 84 causal constraints over 17 iterations in 437 ms. Result :sat
[2020-06-03 23:50:01] [INFO ] [Real]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:01] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2020-06-03 23:50:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:01] [INFO ] [Nat]Absence check using 202 positive place invariants in 163 ms returned sat
[2020-06-03 23:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:02] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2020-06-03 23:50:02] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:50:03] [INFO ] Added : 170 causal constraints over 34 iterations in 842 ms. Result :sat
[2020-06-03 23:50:03] [INFO ] [Real]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:03] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2020-06-03 23:50:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:04] [INFO ] [Nat]Absence check using 202 positive place invariants in 147 ms returned sat
[2020-06-03 23:50:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:04] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2020-06-03 23:50:04] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:50:05] [INFO ] Added : 172 causal constraints over 35 iterations in 872 ms. Result :sat
[2020-06-03 23:50:06] [INFO ] [Real]Absence check using 202 positive place invariants in 771 ms returned sat
[2020-06-03 23:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:08] [INFO ] [Real]Absence check using state equation in 1746 ms returned sat
[2020-06-03 23:50:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:08] [INFO ] [Nat]Absence check using 202 positive place invariants in 76 ms returned sat
[2020-06-03 23:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:10] [INFO ] [Nat]Absence check using state equation in 2024 ms returned sat
[2020-06-03 23:50:10] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2020-06-03 23:50:11] [INFO ] Added : 179 causal constraints over 36 iterations in 1467 ms. Result :sat
[2020-06-03 23:50:11] [INFO ] [Real]Absence check using 202 positive place invariants in 121 ms returned sat
[2020-06-03 23:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:12] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2020-06-03 23:50:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:13] [INFO ] [Nat]Absence check using 202 positive place invariants in 78 ms returned sat
[2020-06-03 23:50:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:13] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2020-06-03 23:50:13] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:50:14] [INFO ] Added : 158 causal constraints over 32 iterations in 744 ms. Result :sat
[2020-06-03 23:50:14] [INFO ] [Real]Absence check using 202 positive place invariants in 384 ms returned sat
[2020-06-03 23:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:16] [INFO ] [Real]Absence check using state equation in 2201 ms returned sat
[2020-06-03 23:50:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:17] [INFO ] [Nat]Absence check using 202 positive place invariants in 698 ms returned sat
[2020-06-03 23:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:19] [INFO ] [Nat]Absence check using state equation in 1851 ms returned sat
[2020-06-03 23:50:19] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2020-06-03 23:50:19] [INFO ] Added : 12 causal constraints over 3 iterations in 217 ms. Result :sat
[2020-06-03 23:50:20] [INFO ] [Real]Absence check using 202 positive place invariants in 882 ms returned sat
[2020-06-03 23:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:21] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2020-06-03 23:50:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:22] [INFO ] [Nat]Absence check using 202 positive place invariants in 114 ms returned sat
[2020-06-03 23:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:23] [INFO ] [Nat]Absence check using state equation in 1680 ms returned sat
[2020-06-03 23:50:23] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:50:24] [INFO ] Added : 104 causal constraints over 21 iterations in 674 ms. Result :sat
[2020-06-03 23:50:24] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:25] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2020-06-03 23:50:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:25] [INFO ] [Nat]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:25] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2020-06-03 23:50:25] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:50:26] [INFO ] Added : 75 causal constraints over 15 iterations in 449 ms. Result :sat
[2020-06-03 23:50:26] [INFO ] [Real]Absence check using 202 positive place invariants in 481 ms returned sat
[2020-06-03 23:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:27] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2020-06-03 23:50:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:27] [INFO ] [Nat]Absence check using 202 positive place invariants in 108 ms returned sat
[2020-06-03 23:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:30] [INFO ] [Nat]Absence check using state equation in 3172 ms returned sat
[2020-06-03 23:50:30] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 30 ms.
[2020-06-03 23:50:31] [INFO ] Added : 75 causal constraints over 15 iterations in 638 ms. Result :sat
[2020-06-03 23:50:31] [INFO ] [Real]Absence check using 202 positive place invariants in 159 ms returned sat
[2020-06-03 23:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:33] [INFO ] [Real]Absence check using state equation in 2151 ms returned sat
[2020-06-03 23:50:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:34] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2020-06-03 23:50:34] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2020-06-03 23:50:35] [INFO ] Added : 175 causal constraints over 35 iterations in 1202 ms. Result :sat
[2020-06-03 23:50:35] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:36] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2020-06-03 23:50:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:36] [INFO ] [Nat]Absence check using 202 positive place invariants in 137 ms returned sat
[2020-06-03 23:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:37] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2020-06-03 23:50:37] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2020-06-03 23:50:38] [INFO ] Added : 185 causal constraints over 37 iterations in 1286 ms. Result :sat
[2020-06-03 23:50:39] [INFO ] [Real]Absence check using 202 positive place invariants in 177 ms returned sat
[2020-06-03 23:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:40] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2020-06-03 23:50:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:40] [INFO ] [Nat]Absence check using 202 positive place invariants in 138 ms returned sat
[2020-06-03 23:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:40] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2020-06-03 23:50:40] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:50:41] [INFO ] Added : 179 causal constraints over 36 iterations in 854 ms. Result :sat
[2020-06-03 23:50:41] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:42] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2020-06-03 23:50:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:42] [INFO ] [Nat]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:42] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2020-06-03 23:50:42] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 29 ms.
[2020-06-03 23:50:43] [INFO ] Added : 17 causal constraints over 4 iterations in 152 ms. Result :sat
[2020-06-03 23:50:43] [INFO ] [Real]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:43] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2020-06-03 23:50:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:44] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2020-06-03 23:50:44] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:50:45] [INFO ] Added : 198 causal constraints over 40 iterations in 953 ms. Result :sat
[2020-06-03 23:50:45] [INFO ] [Real]Absence check using 202 positive place invariants in 107 ms returned sat
[2020-06-03 23:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:45] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2020-06-03 23:50:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 81 ms returned sat
[2020-06-03 23:50:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:46] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2020-06-03 23:50:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:50:46] [INFO ] Added : 17 causal constraints over 4 iterations in 110 ms. Result :sat
[2020-06-03 23:50:46] [INFO ] [Real]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:47] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2020-06-03 23:50:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:47] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:47] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2020-06-03 23:50:47] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:50:48] [INFO ] Added : 104 causal constraints over 21 iterations in 499 ms. Result :sat
[2020-06-03 23:50:48] [INFO ] [Real]Absence check using 202 positive place invariants in 54 ms returned sat
[2020-06-03 23:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:48] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2020-06-03 23:50:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:48] [INFO ] [Nat]Absence check using 202 positive place invariants in 87 ms returned sat
[2020-06-03 23:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:49] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-06-03 23:50:49] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:50:49] [INFO ] Added : 49 causal constraints over 10 iterations in 236 ms. Result :sat
[2020-06-03 23:50:49] [INFO ] [Real]Absence check using 202 positive place invariants in 80 ms returned sat
[2020-06-03 23:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:50] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2020-06-03 23:50:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:50] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:50:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:50] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2020-06-03 23:50:50] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 33 ms.
[2020-06-03 23:50:52] [INFO ] Added : 198 causal constraints over 40 iterations in 1306 ms. Result :sat
[2020-06-03 23:50:52] [INFO ] [Real]Absence check using 202 positive place invariants in 135 ms returned sat
[2020-06-03 23:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:53] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2020-06-03 23:50:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:54] [INFO ] [Nat]Absence check using 202 positive place invariants in 847 ms returned sat
[2020-06-03 23:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:55] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2020-06-03 23:50:55] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 27 ms.
[2020-06-03 23:50:56] [INFO ] Added : 184 causal constraints over 37 iterations in 955 ms. Result :sat
[2020-06-03 23:50:56] [INFO ] [Real]Absence check using 202 positive place invariants in 277 ms returned sat
[2020-06-03 23:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:57] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-06-03 23:50:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:57] [INFO ] [Nat]Absence check using 202 positive place invariants in 72 ms returned sat
[2020-06-03 23:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:57] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2020-06-03 23:50:57] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2020-06-03 23:50:58] [INFO ] Added : 184 causal constraints over 37 iterations in 876 ms. Result :sat
[2020-06-03 23:50:58] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:59] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2020-06-03 23:50:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:59] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:59] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2020-06-03 23:50:59] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:51:00] [INFO ] Added : 139 causal constraints over 28 iterations in 629 ms. Result :sat
[2020-06-03 23:51:00] [INFO ] [Real]Absence check using 202 positive place invariants in 59 ms returned sat
[2020-06-03 23:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:51:01] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2020-06-03 23:51:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:51:01] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:51:01] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2020-06-03 23:51:01] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:51:02] [INFO ] Added : 187 causal constraints over 38 iterations in 894 ms. Result :sat
[2020-06-03 23:51:02] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2020-06-03 23:51:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:51:03] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2020-06-03 23:51:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:51:03] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2020-06-03 23:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:51:04] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2020-06-03 23:51:04] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 34 ms.
[2020-06-03 23:51:04] [INFO ] Added : 124 causal constraints over 25 iterations in 702 ms. Result :sat
[2020-06-03 23:51:05] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 23:51:05] [INFO ] Flatten gal took : 198 ms
FORMULA RefineWMG-PT-100101-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:51:05] [INFO ] Flatten gal took : 72 ms
[2020-06-03 23:51:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2020-06-03 23:51:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-100101 @ 3570 seconds

FORMULA RefineWMG-PT-100101-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100101-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2727
rslt: Output for LTLFireability @ RefineWMG-PT-100101

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:51:06 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((((p366 <= 0) OR (p367 <= 0) OR (p369 <= 0)) R (G ((p238 <= 0)) OR X (((p316 <= 0) OR (p317 <= 0) OR (p319 <= 0))))))",
"processed_size": 124,
"rewrites": 101
},
"result":
{
"edges": 10505,
"markings": 5357,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"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": "G ((1 <= p277))",
"processed_size": 15,
"rewrites": 101
},
"result":
{
"edges": 10650,
"markings": 5835,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 <= p175)",
"processed_size": 11,
"rewrites": 103
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"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": 1,
"visible_transitions": 0
},
"processed": "((1 <= p175) U X ((1 <= p175)))",
"processed_size": 31,
"rewrites": 101
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 2,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((G (((1 <= p441) AND (1 <= p442) AND (1 <= p444))) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p104))) U G ((F (((1 <= p491) AND (1 <= p492) AND (1 <= p494))) AND ((((1 <= p455) U X (((1 <= p441) AND (1 <= p442) AND (1 <= p444)))) AND ((1 <= p491) AND ((1 <= p492) AND (1 <= p494)))) OR X (((1 <= p491) AND (1 <= p492) AND (1 <= p494)))))))",
"processed_size": 339,
"rewrites": 101
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 33
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 471
},
"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": "(p153 <= 0)",
"processed_size": 11,
"rewrites": 103
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 516
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p303 <= 0) R X ((F ((1 <= p225)) AND ((p225 <= 0) AND (F ((p78 <= 0)) OR G ((p225 <= 0)))))))",
"processed_size": 95,
"rewrites": 101
},
"result":
{
"edges": 103,
"markings": 103,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 619
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F (((1 <= p491) AND (1 <= p492) AND (1 <= p494))))",
"processed_size": 53,
"rewrites": 101
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"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": "G (F (((1 <= p36) AND (1 <= p37) AND (1 <= p39) AND (1 <= p150))))",
"processed_size": 66,
"rewrites": 101
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1032
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G (((p76 <= 0) OR (p77 <= 0) OR (p79 <= 0))) OR (G ((1 <= p142)) OR (p472 <= 0))))",
"processed_size": 88,
"rewrites": 101
},
"result":
{
"edges": 465981,
"markings": 241636,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 8,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((F ((F (((1 <= p461) AND (1 <= p462) AND (1 <= p464))) AND ((1 <= p461) AND ((1 <= p462) AND (1 <= p464))))) AND (G ((1 <= p148)) AND ((1 <= p275) AND ((1 <= p461) AND ((1 <= p462) AND (1 <= p464)))))))",
"processed_size": 205,
"rewrites": 101
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3094
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277))))",
"processed_size": 75,
"rewrites": 101
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"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": "(p153 <= 0)",
"processed_size": 11,
"rewrites": 103
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277))))",
"processed_size": 75,
"rewrites": 101
},
"result":
{
"edges": 7,
"markings": 7,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((p277 <= 0)) AND F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277)))))",
"processed_size": 97,
"rewrites": 101
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3664,
"runtime": 843.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((* R (G(*) OR X(*)))) : ((** U X(**)) AND (F(*) OR G(**))) : ((G(**) OR **) U G((F(**) AND (((** U X(**)) AND (** AND (** AND **))) OR X(**))))) : G(F(**)) : (G(F((G(**) AND *))) OR F((G(*) AND F((G(**) AND *))))) : F((G(*) OR (G(**) OR **))) : X(((** U G(**)) AND (F(**) OR **))) : (F(**) OR X(X(G((F(**) AND (** OR **)))))) : F((F((F(**) AND (** AND (** AND **)))) AND (G(**) AND (** AND (** AND (** AND **)))))) : G(F(**)) : (* R X((F(**) AND (* AND (F(*) OR G(*))))))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "yes no no no no no unknown unknown no no no ",
"value": "yes no no no no no unknown unknown no no no "
},
"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 LTLFireability.xml
lola: NOT(X ((((1 <= p366) AND (1 <= p367) AND (1 <= p369)) U (F ((((1 <= p316) AND (1 <= p317) AND (1 <= p319)) U (1 <= p238))) AND X (((1 <= p316) AND (1 <= p317) AND (1 <= p319))))))) : (((1 <= p175) U X ((1 <= p175))) AND (NOT(G ((1 <= p175))) OR G ((1 <= p277)))) : ((G (((1 <= p441) AND (1 <= p442) AND (1 <= p444))) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p104))) U G (((((((1 <= p455) U X (((1 <= p441) AND (1 <= p442) AND (1 <= p444)))) AND (1 <= p491)) AND (1 <= p492)) AND (1 <= p494)) U X (((1 <= p491) AND (1 <= p492) AND (1 <= p494)))))) : X (G ((X ((1 <= p410)) U ((((G ((1 <= p330)) AND (1 <= p491)) AND (1 <= p492)) AND (1 <= p494)) U F (((1 <= p491) AND (1 <= p492) AND (1 <= p494))))))) : NOT(G ((F ((1 <= p277)) U G ((NOT(G (((1 <= p291) AND (1 <= p292) AND (1 <= p294)))) OR (p277 <= 0)))))) : F (((NOT(F (((1 <= p76) AND (1 <= p77) AND (1 <= p79)))) OR G ((1 <= p142))) OR (p472 <= 0))) : X (((((1 <= p66) AND (1 <= p67) AND (1 <= p69)) U G ((1 <= p482))) AND (F ((1 <= p410)) OR (1 <= p482)))) : (F ((1 <= p153)) OR NOT(F (X (F (X (NOT(((1 <= p153) U ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0)))))))))) : F ((((((F ((((F (((1 <= p461) AND (1 <= p462) AND (1 <= p464))) AND (1 <= p461)) AND (1 <= p462)) AND (1 <= p464))) AND G ((1 <= p148))) AND (1 <= p275)) AND (1 <= p461)) AND (1 <= p462)) AND (1 <= p464))) : F (X (G ((F (X (X ((((G (((1 <= p386) AND (1 <= p387) AND (1 <= p389))) AND (1 <= p36)) AND (1 <= p37)) AND (1 <= p39))))) U F (((1 <= p36) AND (1 <= p37) AND (1 <= p39) AND (1 <= p150))))))) : NOT(((1 <= p303) U X ((NOT(F ((((1 <= p26) AND (1 <= p27) AND (1 <= p29)) U (1 <= p225)))) OR (G ((1 <= p78)) U (1 <= p225))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p366 <= 0) OR (p367 <= 0) OR (p369 <= 0)) R (G ((p238 <= 0)) OR X (((p316 <= 0) OR (p317 <= 0) OR (p319 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p366 <= 0) OR (p367 <= 0) OR (p369 <= 0)) R (G ((p238 <= 0)) OR X (((p316 <= 0) OR (p317 <= 0) OR (p319 <= 0))))))
lola: processed formula length: 124
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5357 markings, 10505 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p175) U X ((1 <= p175))) AND (F ((p175 <= 0)) OR G ((1 <= p277))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p277))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p277))
lola: processed formula length: 15
lola: 101 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5835 markings, 10650 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p175 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p175)
lola: processed formula length: 11
lola: 103 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p175) U X ((1 <= p175)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p175) U X ((1 <= p175)))
lola: processed formula length: 31
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 102 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p441) AND (1 <= p442) AND (1 <= p444))) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p104))) U G ((F (((1 <= p491) AND (1 <= p492) AND (1 <= p494))) AND ((((1 <= p455) U X (((1 <= p441) AND (1 <= p442) AND (1 <= p444)))) AND ((1 <= p491) AND ((1 <= p492) AND (1 <= p494)))) OR X (((1 <= p491) AND (1 <= p492) AND (1 <= p494)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((1 <= p441) AND (1 <= p442) AND (1 <= p444))) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p104))) U G ((F (((1 <= p491) AND (1 <= p492) AND (1 <= p494))) AND ((((1 <= p455) U X (((1 <= p441) AND (1 <= p442) AND (1 <= p444)))) AND ((1 <= p491) AND ((1 <= p492) AND (1 <= p494)))) OR X (((1 <= p491) AND (1 <= p492) AND (1 <= p494)))))))
lola: processed formula length: 339
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 33 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 102 markings, 102 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p66) AND (1 <= p67) AND (1 <= p69)) U G ((1 <= p482))) AND (F ((1 <= p410)) OR (1 <= p482))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p66) AND (1 <= p67) AND (1 <= p69)) U G ((1 <= p482))) AND (F ((1 <= p410)) OR (1 <= p482))))
lola: processed formula length: 105
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1451138 markings, 2183786 edges, 290228 markings/sec, 0 secs
lola: 2822461 markings, 4247550 edges, 274265 markings/sec, 5 secs
lola: 4219985 markings, 6350824 edges, 279505 markings/sec, 10 secs
lola: 5629704 markings, 8472299 edges, 281944 markings/sec, 15 secs
lola: 6998560 markings, 10532383 edges, 273771 markings/sec, 20 secs
lola: 8348877 markings, 12564596 edges, 270063 markings/sec, 25 secs
lola: 9717061 markings, 14623608 edges, 273637 markings/sec, 30 secs
lola: 11091427 markings, 16691987 edges, 274873 markings/sec, 35 secs
lola: 12421578 markings, 18693825 edges, 266030 markings/sec, 40 secs
lola: 13795862 markings, 20762006 edges, 274857 markings/sec, 45 secs
lola: 15115153 markings, 22747482 edges, 263858 markings/sec, 50 secs
lola: 16468111 markings, 24783611 edges, 270592 markings/sec, 55 secs
lola: 17794394 markings, 26779574 edges, 265257 markings/sec, 60 secs
lola: 19160448 markings, 28835470 edges, 273211 markings/sec, 65 secs
lola: 20510100 markings, 30866575 edges, 269930 markings/sec, 70 secs
lola: 21844904 markings, 32875426 edges, 266961 markings/sec, 75 secs
lola: 23202150 markings, 34918059 edges, 271449 markings/sec, 80 secs
lola: 24543342 markings, 36936357 edges, 268238 markings/sec, 85 secs
lola: 25124279 markings, 37811135 edges, 116187 markings/sec, 90 secs
lola: 25739173 markings, 38736865 edges, 122979 markings/sec, 95 secs
lola: 26290584 markings, 39565884 edges, 110282 markings/sec, 100 secs
lola: 26290584 markings, 39565884 edges, 0 markings/sec, 105 secs
lola: 26301313 markings, 39582121 edges, 2146 markings/sec, 110 secs
lola: 26452162 markings, 39809062 edges, 30170 markings/sec, 115 secs
lola: 26452162 markings, 39809062 edges, 0 markings/sec, 120 secs
lola: 26579887 markings, 40001267 edges, 25545 markings/sec, 125 secs
lola: 27165525 markings, 40882653 edges, 117128 markings/sec, 130 secs
lola: 27462908 markings, 41330269 edges, 59477 markings/sec, 135 secs
lola: 27462908 markings, 41330269 edges, 0 markings/sec, 140 secs
lola: 27965308 markings, 42086350 edges, 100480 markings/sec, 145 secs
lola: 28340805 markings, 42651405 edges, 75099 markings/sec, 150 secs
lola: 28340805 markings, 42651405 edges, 0 markings/sec, 155 secs
lola: 29162047 markings, 43887324 edges, 164248 markings/sec, 160 secs
lola: 29832760 markings, 44896776 edges, 134143 markings/sec, 165 secs
lola: 30506279 markings, 45910333 edges, 134704 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p153)) OR X (X (G ((F (((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))) AND ((1 <= p153) OR ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p153))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p153 <= 0)
lola: processed formula length: 11
lola: 103 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: subprocess 5 will run for 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))) AND ((1 <= p153) OR ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))) AND ((1 <= p153) OR ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0)))))))
lola: processed formula length: 124
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: ========================================
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1309902 markings, 1971283 edges, 261980 markings/sec, 0 secs
lola: 2627910 markings, 3954808 edges, 263602 markings/sec, 5 secs
lola: 3935470 markings, 5922608 edges, 261512 markings/sec, 10 secs
lola: 5263419 markings, 7921121 edges, 265590 markings/sec, 15 secs
lola: 6585429 markings, 9910632 edges, 264402 markings/sec, 20 secs
lola: 7917349 markings, 11915086 edges, 266384 markings/sec, 25 secs
lola: 9231820 markings, 13893355 edges, 262894 markings/sec, 30 secs
lola: 11299421 markings, 17004995 edges, 413520 markings/sec, 35 secs
lola: 12652217 markings, 19040911 edges, 270559 markings/sec, 40 secs
lola: 13971492 markings, 21026277 edges, 263855 markings/sec, 45 secs
lola: 15306919 markings, 23036078 edges, 267085 markings/sec, 50 secs
lola: 16652043 markings, 25060413 edges, 269025 markings/sec, 55 secs
lola: 17977439 markings, 27055065 edges, 265079 markings/sec, 60 secs
lola: 19321176 markings, 29077310 edges, 268747 markings/sec, 65 secs
lola: 20657022 markings, 31087722 edges, 267169 markings/sec, 70 secs
lola: 21946951 markings, 33028993 edges, 257986 markings/sec, 75 secs
lola: 23282041 markings, 35038258 edges, 267018 markings/sec, 80 secs
lola: 24605517 markings, 37030238 edges, 264695 markings/sec, 85 secs
lola: 24979558 markings, 37593359 edges, 74808 markings/sec, 90 secs
lola: 25101543 markings, 37776953 edges, 24397 markings/sec, 95 secs
lola: 25629888 markings, 38576801 edges, 105669 markings/sec, 100 secs
lola: 26026931 markings, 39169183 edges, 79409 markings/sec, 105 secs
lola: 26476103 markings, 39845104 edges, 89834 markings/sec, 110 secs
lola: 27039499 markings, 40692973 edges, 112679 markings/sec, 115 secs
lola: 27198152 markings, 40931802 edges, 31731 markings/sec, 120 secs
lola: 27293672 markings, 41075514 edges, 19104 markings/sec, 125 secs
lola: 27904124 markings, 41994286 edges, 122090 markings/sec, 130 secs
lola: 28491900 markings, 42878796 edges, 117555 markings/sec, 135 secs
lola: 29318470 markings, 44122810 edges, 165314 markings/sec, 140 secs
lola: 29588364 markings, 44528997 edges, 53979 markings/sec, 145 secs
lola: 29830956 markings, 44894036 edges, 48518 markings/sec, 150 secs
lola: 30625778 markings, 46090166 edges, 158964 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 5 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p303 <= 0) R X ((F ((1 <= p225)) AND ((p225 <= 0) AND (F ((p78 <= 0)) OR G ((p225 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p303 <= 0) R X ((F ((1 <= p225)) AND ((p225 <= 0) AND (F ((p78 <= 0)) OR G ((p225 <= 0)))))))
lola: processed formula length: 95
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 103 markings, 103 edges
lola: ========================================
lola: subprocess 6 will run for 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p491) AND (1 <= p492) AND (1 <= p494))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p491) AND (1 <= p492) AND (1 <= p494))))
lola: processed formula length: 53
lola: 101 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p36) AND (1 <= p37) AND (1 <= p39) AND (1 <= p150))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p36) AND (1 <= p37) AND (1 <= p39) AND (1 <= p150))))
lola: processed formula length: 66
lola: 101 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 1032 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p76 <= 0) OR (p77 <= 0) OR (p79 <= 0))) OR (G ((1 <= p142)) OR (p472 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p76 <= 0) OR (p77 <= 0) OR (p79 <= 0))) OR (G ((1 <= p142)) OR (p472 <= 0))))
lola: processed formula length: 88
lola: 101 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 401
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 241636 markings, 465981 edges
lola: ========================================
lola: subprocess 9 will run for 1547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((F (((1 <= p461) AND (1 <= p462) AND (1 <= p464))) AND ((1 <= p461) AND ((1 <= p462) AND (1 <= p464))))) AND (G ((1 <= p148)) AND ((1 <= p275) AND ((1 <= p461) AND ((1 <= p462) AND (1 <= p464)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((F (((1 <= p461) AND (1 <= p462) AND (1 <= p464))) AND ((1 <= p461) AND ((1 <= p462) AND (1 <= p464))))) AND (G ((1 <= p148)) AND ((1 <= p275) AND ((1 <= p461) AND ((1 <= p462) AND (1 <= p464)))))))
lola: processed formula length: 205
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 3094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277)))) OR F ((G ((p277 <= 0)) AND F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277))))
lola: processed formula length: 75
lola: 101 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
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: X (((((1 <= p66) AND (1 <= p67) AND (1 <= p69)) U G ((1 <= p482))) AND (F ((1 <= p410)) OR (1 <= p482))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p66) AND (1 <= p67) AND (1 <= p69)) U G ((1 <= p482))) AND (F ((1 <= p410)) OR (1 <= p482))))
lola: processed formula length: 105
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1411765 markings, 2124541 edges, 282353 markings/sec, 0 secs
lola: 2715407 markings, 4086453 edges, 260728 markings/sec, 5 secs
lola: 4071832 markings, 6127857 edges, 271285 markings/sec, 10 secs
lola: 5434864 markings, 8179083 edges, 272606 markings/sec, 15 secs
lola: 6769742 markings, 10188068 edges, 266976 markings/sec, 20 secs
lola: 8116078 markings, 12214236 edges, 269267 markings/sec, 25 secs
lola: 9459967 markings, 14236653 edges, 268778 markings/sec, 30 secs
lola: 10816462 markings, 16278191 edges, 271299 markings/sec, 35 secs
lola: 12189667 markings, 18344766 edges, 274641 markings/sec, 40 secs
lola: 13564949 markings, 20414503 edges, 275056 markings/sec, 45 secs
lola: 14961310 markings, 22515991 edges, 279272 markings/sec, 50 secs
lola: 16299053 markings, 24529162 edges, 267549 markings/sec, 55 secs
lola: 17632575 markings, 26536053 edges, 266704 markings/sec, 60 secs
lola: 19008842 markings, 28607261 edges, 275253 markings/sec, 65 secs
lola: 20375868 markings, 30664566 edges, 273405 markings/sec, 70 secs
lola: 21715725 markings, 32680980 edges, 267971 markings/sec, 75 secs
lola: 23100585 markings, 34765179 edges, 276972 markings/sec, 80 secs
lola: 24445879 markings, 36789731 edges, 269059 markings/sec, 85 secs
lola: 24897127 markings, 37468945 edges, 90250 markings/sec, 90 secs
lola: 25349119 markings, 38149087 edges, 90398 markings/sec, 95 secs
lola: 25869578 markings, 38932928 edges, 104092 markings/sec, 100 secs
lola: 25926319 markings, 39017766 edges, 11348 markings/sec, 105 secs
lola: 25926319 markings, 39017766 edges, 0 markings/sec, 110 secs
lola: 26137894 markings, 39336169 edges, 42315 markings/sec, 115 secs
lola: 26837200 markings, 40388569 edges, 139861 markings/sec, 120 secs
lola: 27532103 markings, 41434391 edges, 138981 markings/sec, 125 secs
lola: 28259210 markings, 42528608 edges, 145421 markings/sec, 130 secs
lola: 28267126 markings, 42540495 edges, 1583 markings/sec, 135 secs
lola: 28363119 markings, 42685018 edges, 19199 markings/sec, 140 secs
lola: 28705379 markings, 43200027 edges, 68452 markings/sec, 145 secs
lola: 29140660 markings, 43855123 edges, 87056 markings/sec, 150 secs
lola: 29642754 markings, 44610775 edges, 100419 markings/sec, 155 secs
lola: 30088898 markings, 45282223 edges, 89229 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p153)) OR X (X (G ((F (((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))) AND ((1 <= p153) OR ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p153))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p153 <= 0)
lola: processed formula length: 11
lola: 103 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))) AND ((1 <= p153) OR ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0))) AND ((1 <= p153) OR ((p46 <= 0) OR (p47 <= 0) OR (p49 <= 0)))))))
lola: processed formula length: 124
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1350461 markings, 2032316 edges, 270092 markings/sec, 0 secs
lola: 2680028 markings, 4033220 edges, 265913 markings/sec, 5 secs
lola: 4020761 markings, 6050969 edges, 268147 markings/sec, 10 secs
lola: 5353780 markings, 8057090 edges, 266604 markings/sec, 15 secs
lola: 6678321 markings, 10050505 edges, 264908 markings/sec, 20 secs
lola: 8007829 markings, 12051335 edges, 265902 markings/sec, 25 secs
lola: 9250029 markings, 13920719 edges, 248440 markings/sec, 30 secs
lola: 10556471 markings, 15886883 edges, 261288 markings/sec, 35 secs
lola: 11855811 markings, 17842307 edges, 259868 markings/sec, 40 secs
lola: 13112876 markings, 19734164 edges, 251413 markings/sec, 45 secs
lola: 14430015 markings, 21716343 edges, 263428 markings/sec, 50 secs
lola: 15674293 markings, 23588934 edges, 248856 markings/sec, 55 secs
lola: 16930545 markings, 25479572 edges, 251250 markings/sec, 60 secs
lola: 18221161 markings, 27421818 edges, 258123 markings/sec, 65 secs
lola: 19524019 markings, 29382620 edges, 260572 markings/sec, 70 secs
lola: 20804286 markings, 31309350 edges, 256053 markings/sec, 75 secs
lola: 22099556 markings, 33258662 edges, 259054 markings/sec, 80 secs
lola: 23392380 markings, 35204291 edges, 258565 markings/sec, 85 secs
lola: 24662331 markings, 37116156 edges, 253990 markings/sec, 90 secs
lola: 24894657 markings, 37465515 edges, 46465 markings/sec, 95 secs
lola: 25056375 markings, 37708517 edges, 32344 markings/sec, 100 secs
lola: 25056375 markings, 37708517 edges, 0 markings/sec, 105 secs
lola: 25519926 markings, 38406710 edges, 92710 markings/sec, 110 secs
lola: 25764346 markings, 38774000 edges, 48884 markings/sec, 115 secs
lola: 25764346 markings, 38774000 edges, 0 markings/sec, 120 secs
lola: 25851359 markings, 38904911 edges, 17403 markings/sec, 125 secs
lola: 26218080 markings, 39456864 edges, 73344 markings/sec, 130 secs
lola: 26880174 markings, 40453219 edges, 132419 markings/sec, 135 secs
lola: 27865199 markings, 41935692 edges, 197005 markings/sec, 140 secs
lola: 28794765 markings, 43334600 edges, 185913 markings/sec, 145 secs
lola: 29251198 markings, 44021521 edges, 91287 markings/sec, 150 secs
lola: 29750513 markings, 44772991 edges, 99863 markings/sec, 155 secs
lola: 30005821 markings, 45157206 edges, 51062 markings/sec, 160 secs
lola: 30590105 markings, 46036474 edges, 116857 markings/sec, 165 secs
lola: 30591628 markings, 46038806 edges, 305 markings/sec, 170 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: (G (F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277)))) OR F ((G ((p277 <= 0)) AND F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277))))
lola: processed formula length: 75
lola: 101 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G ((p277 <= 0)) AND F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p277 <= 0)) AND F ((G (((1 <= p291) AND (1 <= p292) AND (1 <= p294))) AND (1 <= p277)))))
lola: processed formula length: 97
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no unknown unknown no no no
lola:
preliminary result: yes no no no no no unknown unknown no no no
lola: memory consumption: 3664 KB
lola: time consumption: 843 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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-100101"
export BK_EXAMINATION="LTLFireability"
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-100101, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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