Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r246-smll-162106594400154.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is ShieldRVt-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 109K May 5 16:52 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 ShieldRVt-PT-040A-00
FORMULA_NAME ShieldRVt-PT-040A-01
FORMULA_NAME ShieldRVt-PT-040A-02
FORMULA_NAME ShieldRVt-PT-040A-03
FORMULA_NAME ShieldRVt-PT-040A-04
FORMULA_NAME ShieldRVt-PT-040A-05
FORMULA_NAME ShieldRVt-PT-040A-06
FORMULA_NAME ShieldRVt-PT-040A-07
FORMULA_NAME ShieldRVt-PT-040A-08
FORMULA_NAME ShieldRVt-PT-040A-09
FORMULA_NAME ShieldRVt-PT-040A-10
FORMULA_NAME ShieldRVt-PT-040A-11
FORMULA_NAME ShieldRVt-PT-040A-12
FORMULA_NAME ShieldRVt-PT-040A-13
FORMULA_NAME ShieldRVt-PT-040A-14
FORMULA_NAME ShieldRVt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1621327298576

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 08:41:41] [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]
[2021-05-18 08:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 08:41:41] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2021-05-18 08:41:41] [INFO ] Transformed 323 places.
[2021-05-18 08:41:41] [INFO ] Transformed 323 transitions.
[2021-05-18 08:41:41] [INFO ] Found NUPN structural information;
[2021-05-18 08:41:41] [INFO ] Parsed PT model containing 323 places and 323 transitions in 271 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 769 ms. (steps per millisecond=130 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1]
// Phase 1: matrix 322 rows 323 cols
[2021-05-18 08:41:42] [INFO ] Computed 161 place invariants in 23 ms
[2021-05-18 08:41:43] [INFO ] [Real]Absence check using 161 positive place invariants in 172 ms returned sat
[2021-05-18 08:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:44] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2021-05-18 08:41:44] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 69 ms.
[2021-05-18 08:41:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:41:44] [INFO ] [Nat]Absence check using 161 positive place invariants in 103 ms returned sat
[2021-05-18 08:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:45] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2021-05-18 08:41:45] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 85 ms.
[2021-05-18 08:41:49] [INFO ] Added : 315 causal constraints over 64 iterations in 4025 ms. Result :sat
[2021-05-18 08:41:49] [INFO ] [Real]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:49] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2021-05-18 08:41:50] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 48 ms.
[2021-05-18 08:41:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:41:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 83 ms returned sat
[2021-05-18 08:41:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:50] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2021-05-18 08:41:50] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 48 ms.
[2021-05-18 08:41:53] [INFO ] Added : 317 causal constraints over 64 iterations in 2987 ms. Result :sat
[2021-05-18 08:41:54] [INFO ] [Real]Absence check using 161 positive place invariants in 118 ms returned sat
[2021-05-18 08:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:54] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2021-05-18 08:41:54] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 52 ms.
[2021-05-18 08:41:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:41:55] [INFO ] [Nat]Absence check using 161 positive place invariants in 118 ms returned sat
[2021-05-18 08:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:55] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2021-05-18 08:41:55] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 27 ms.
[2021-05-18 08:41:59] [INFO ] Added : 320 causal constraints over 64 iterations in 3997 ms. Result :sat
[2021-05-18 08:41:59] [INFO ] [Real]Absence check using 161 positive place invariants in 86 ms returned sat
[2021-05-18 08:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:00] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2021-05-18 08:42:00] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 38 ms.
[2021-05-18 08:42:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:01] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2021-05-18 08:42:01] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 27 ms.
[2021-05-18 08:42:04] [INFO ] Added : 319 causal constraints over 65 iterations in 3788 ms. Result :sat
[2021-05-18 08:42:05] [INFO ] [Real]Absence check using 161 positive place invariants in 113 ms returned sat
[2021-05-18 08:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:05] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2021-05-18 08:42:05] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:42:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:05] [INFO ] [Nat]Absence check using 161 positive place invariants in 79 ms returned sat
[2021-05-18 08:42:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:06] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2021-05-18 08:42:06] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 24 ms.
[2021-05-18 08:42:09] [INFO ] Added : 316 causal constraints over 64 iterations in 2859 ms. Result :sat
[2021-05-18 08:42:09] [INFO ] [Real]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:09] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-18 08:42:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 29 ms.
[2021-05-18 08:42:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 106 ms returned sat
[2021-05-18 08:42:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:10] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2021-05-18 08:42:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2021-05-18 08:42:14] [INFO ] Added : 316 causal constraints over 64 iterations in 3912 ms. Result :sat
[2021-05-18 08:42:14] [INFO ] [Real]Absence check using 161 positive place invariants in 77 ms returned sat
[2021-05-18 08:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:15] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2021-05-18 08:42:15] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2021-05-18 08:42:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 120 ms returned sat
[2021-05-18 08:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:15] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2021-05-18 08:42:16] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 27 ms.
[2021-05-18 08:42:19] [INFO ] Added : 320 causal constraints over 65 iterations in 3137 ms. Result :sat
[2021-05-18 08:42:19] [INFO ] [Real]Absence check using 161 positive place invariants in 122 ms returned sat
[2021-05-18 08:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:19] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2021-05-18 08:42:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 35 ms.
[2021-05-18 08:42:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 84 ms returned sat
[2021-05-18 08:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:20] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2021-05-18 08:42:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 28 ms.
[2021-05-18 08:42:24] [INFO ] Added : 316 causal constraints over 64 iterations in 3403 ms. Result :sat
[2021-05-18 08:42:24] [INFO ] [Real]Absence check using 161 positive place invariants in 84 ms returned sat
[2021-05-18 08:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:24] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2021-05-18 08:42:24] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 30 ms.
[2021-05-18 08:42:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 80 ms returned sat
[2021-05-18 08:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:25] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2021-05-18 08:42:25] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2021-05-18 08:42:28] [INFO ] Added : 321 causal constraints over 65 iterations in 2726 ms. Result :sat
[2021-05-18 08:42:28] [INFO ] [Real]Absence check using 161 positive place invariants in 106 ms returned sat
[2021-05-18 08:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:28] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2021-05-18 08:42:28] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 24 ms.
[2021-05-18 08:42:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 107 ms returned sat
[2021-05-18 08:42:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:29] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2021-05-18 08:42:29] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:42:33] [INFO ] Added : 316 causal constraints over 64 iterations in 3636 ms. Result :sat
[2021-05-18 08:42:33] [INFO ] [Real]Absence check using 161 positive place invariants in 132 ms returned sat
[2021-05-18 08:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:34] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-18 08:42:34] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 37 ms.
[2021-05-18 08:42:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:34] [INFO ] [Nat]Absence check using 161 positive place invariants in 126 ms returned sat
[2021-05-18 08:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:35] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2021-05-18 08:42:35] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 43 ms.
[2021-05-18 08:42:38] [INFO ] Added : 315 causal constraints over 64 iterations in 3736 ms. Result :sat
[2021-05-18 08:42:39] [INFO ] [Real]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:39] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2021-05-18 08:42:39] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:42:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:40] [INFO ] [Nat]Absence check using 161 positive place invariants in 107 ms returned sat
[2021-05-18 08:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:40] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2021-05-18 08:42:40] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:42:44] [INFO ] Added : 316 causal constraints over 64 iterations in 3860 ms. Result :sat
[2021-05-18 08:42:44] [INFO ] [Real]Absence check using 161 positive place invariants in 118 ms returned sat
[2021-05-18 08:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:45] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2021-05-18 08:42:45] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:42:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:45] [INFO ] [Nat]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:46] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2021-05-18 08:42:46] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 43 ms.
[2021-05-18 08:42:49] [INFO ] Added : 317 causal constraints over 64 iterations in 3638 ms. Result :sat
[2021-05-18 08:42:50] [INFO ] [Real]Absence check using 161 positive place invariants in 130 ms returned sat
[2021-05-18 08:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:50] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2021-05-18 08:42:50] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:42:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 225 ms returned sat
[2021-05-18 08:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:51] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2021-05-18 08:42:52] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 33 ms.
[2021-05-18 08:42:55] [INFO ] Added : 318 causal constraints over 65 iterations in 3950 ms. Result :sat
[2021-05-18 08:42:56] [INFO ] [Real]Absence check using 161 positive place invariants in 129 ms returned sat
[2021-05-18 08:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:56] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2021-05-18 08:42:56] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 38 ms.
[2021-05-18 08:42:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:42:57] [INFO ] [Nat]Absence check using 161 positive place invariants in 116 ms returned sat
[2021-05-18 08:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:42:57] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2021-05-18 08:42:57] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 33 ms.
[2021-05-18 08:43:01] [INFO ] Added : 320 causal constraints over 65 iterations in 3902 ms. Result :sat
[2021-05-18 08:43:01] [INFO ] [Real]Absence check using 161 positive place invariants in 121 ms returned sat
[2021-05-18 08:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:02] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2021-05-18 08:43:02] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 37 ms.
[2021-05-18 08:43:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:02] [INFO ] [Nat]Absence check using 161 positive place invariants in 111 ms returned sat
[2021-05-18 08:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:03] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2021-05-18 08:43:03] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 33 ms.
[2021-05-18 08:43:07] [INFO ] Added : 317 causal constraints over 64 iterations in 4106 ms. Result :sat
[2021-05-18 08:43:07] [INFO ] [Real]Absence check using 161 positive place invariants in 105 ms returned sat
[2021-05-18 08:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:08] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2021-05-18 08:43:08] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 30 ms.
[2021-05-18 08:43:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:08] [INFO ] [Nat]Absence check using 161 positive place invariants in 104 ms returned sat
[2021-05-18 08:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:09] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2021-05-18 08:43:09] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:43:13] [INFO ] Added : 318 causal constraints over 65 iterations in 4275 ms. Result :sat
[2021-05-18 08:43:13] [INFO ] [Real]Absence check using 161 positive place invariants in 115 ms returned sat
[2021-05-18 08:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:14] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2021-05-18 08:43:14] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:43:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:14] [INFO ] [Nat]Absence check using 161 positive place invariants in 132 ms returned sat
[2021-05-18 08:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:15] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2021-05-18 08:43:15] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 43 ms.
[2021-05-18 08:43:19] [INFO ] Added : 318 causal constraints over 64 iterations in 3824 ms. Result :sat
[2021-05-18 08:43:19] [INFO ] [Real]Absence check using 161 positive place invariants in 120 ms returned sat
[2021-05-18 08:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:19] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2021-05-18 08:43:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:43:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 120 ms returned sat
[2021-05-18 08:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:20] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2021-05-18 08:43:21] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:43:25] [INFO ] Added : 316 causal constraints over 64 iterations in 4238 ms. Result :sat
[2021-05-18 08:43:25] [INFO ] [Real]Absence check using 161 positive place invariants in 67 ms returned sat
[2021-05-18 08:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:25] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2021-05-18 08:43:25] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2021-05-18 08:43:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 88 ms returned sat
[2021-05-18 08:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:26] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2021-05-18 08:43:26] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 26 ms.
[2021-05-18 08:43:30] [INFO ] Added : 319 causal constraints over 65 iterations in 4100 ms. Result :sat
[2021-05-18 08:43:30] [INFO ] [Real]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:31] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2021-05-18 08:43:31] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:43:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 115 ms returned sat
[2021-05-18 08:43:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:32] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2021-05-18 08:43:32] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 41 ms.
[2021-05-18 08:43:36] [INFO ] Added : 317 causal constraints over 64 iterations in 4279 ms. Result :sat
[2021-05-18 08:43:36] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2021-05-18 08:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:37] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2021-05-18 08:43:37] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 28 ms.
[2021-05-18 08:43:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:37] [INFO ] [Nat]Absence check using 161 positive place invariants in 79 ms returned sat
[2021-05-18 08:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:38] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2021-05-18 08:43:38] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 35 ms.
[2021-05-18 08:43:41] [INFO ] Added : 320 causal constraints over 65 iterations in 3969 ms. Result :sat
[2021-05-18 08:43:42] [INFO ] [Real]Absence check using 161 positive place invariants in 113 ms returned sat
[2021-05-18 08:43:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:42] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2021-05-18 08:43:42] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:43:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 118 ms returned sat
[2021-05-18 08:43:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:43] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2021-05-18 08:43:43] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 36 ms.
[2021-05-18 08:43:47] [INFO ] Added : 320 causal constraints over 65 iterations in 3975 ms. Result :sat
[2021-05-18 08:43:48] [INFO ] [Real]Absence check using 161 positive place invariants in 114 ms returned sat
[2021-05-18 08:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:48] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2021-05-18 08:43:48] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2021-05-18 08:43:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:48] [INFO ] [Nat]Absence check using 161 positive place invariants in 71 ms returned sat
[2021-05-18 08:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:49] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2021-05-18 08:43:49] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:43:53] [INFO ] Added : 319 causal constraints over 65 iterations in 4371 ms. Result :sat
[2021-05-18 08:43:53] [INFO ] [Real]Absence check using 161 positive place invariants in 85 ms returned sat
[2021-05-18 08:43:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:54] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2021-05-18 08:43:54] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 33 ms.
[2021-05-18 08:43:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 116 ms returned sat
[2021-05-18 08:43:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:55] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2021-05-18 08:43:55] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 44 ms.
[2021-05-18 08:43:59] [INFO ] Added : 316 causal constraints over 64 iterations in 3588 ms. Result :sat
[2021-05-18 08:43:59] [INFO ] [Real]Absence check using 161 positive place invariants in 113 ms returned sat
[2021-05-18 08:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:59] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2021-05-18 08:44:00] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 50 ms.
[2021-05-18 08:44:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:44:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 115 ms returned sat
[2021-05-18 08:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:44:00] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2021-05-18 08:44:00] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 50 ms.
[2021-05-18 08:44:04] [INFO ] Added : 316 causal constraints over 64 iterations in 3522 ms. Result :sat
[2021-05-18 08:44:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 08:44:05] [INFO ] Flatten gal took : 137 ms
FORMULA ShieldRVt-PT-040A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 08:44:05] [INFO ] Applying decomposition
[2021-05-18 08:44:05] [INFO ] Flatten gal took : 48 ms
[2021-05-18 08:44:05] [INFO ] Decomposing Gal with order
[2021-05-18 08:44:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:44:05] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-18 08:44:05] [INFO ] Flatten gal took : 317 ms
[2021-05-18 08:44:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 40 ms.
[2021-05-18 08:44:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2021-05-18 08:44:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVt-PT-040A @ 3570 seconds

FORMULA ShieldRVt-PT-040A-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3123
rslt: Output for LTLFireability @ ShieldRVt-PT-040A

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 08:44:07 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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 (((p171 <= 0) OR (p180 <= 0) OR (p186 <= 0)))",
"processed_size": 49,
"rewrites": 76
},
"result":
{
"edges": 1630,
"markings": 1086,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 333
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "(((p198 <= 0) OR (p201 <= 0)) R X (((p198 <= 0) OR (p201 <= 0))))",
"processed_size": 67,
"rewrites": 76
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (F (((1 <= p125))))",
"processed_size": 21,
"rewrites": 76
},
"result":
{
"edges": 342,
"markings": 342,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 333
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((((p316 <= 0) OR (p317 <= 0) OR (p320 <= 0)) AND (X (F (((p316 <= 0) OR (p317 <= 0) OR (p320 <= 0)))) OR (G (((p105 <= 0))) AND ((p190 <= 0) OR (p193 <= 0))))))",
"processed_size": 168,
"rewrites": 76
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 370
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p147 <= 0))",
"processed_size": 13,
"rewrites": 78
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(X (((1 <= p87))) U ((1 <= p101)))",
"processed_size": 34,
"rewrites": 76
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 476
},
"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": "F (G (((1 <= p171) AND (1 <= p180) AND (1 <= p186))))",
"processed_size": 53,
"rewrites": 76
},
"result":
{
"edges": 7,
"markings": 6,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"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": "(((1 <= p12) AND (1 <= p13) AND (1 <= p16)) U X (((1 <= p259))))",
"processed_size": 64,
"rewrites": 76
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((((p289 <= 0)) R ((p309 <= 0))))))",
"processed_size": 43,
"rewrites": 76
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"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": 556
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p159)))",
"processed_size": 17,
"rewrites": 76
},
"result":
{
"edges": 5,
"markings": 5,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 667
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (((1 <= p159)))",
"processed_size": 17,
"rewrites": 76
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G (F (((1 <= p64) AND (1 <= p66) AND (1 <= p71)))) OR ((1 <= p214) AND (1 <= p217))))",
"processed_size": 89,
"rewrites": 76
},
"result":
{
"edges": 5,
"markings": 5,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 833
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "F (G (((1 <= p183))))",
"processed_size": 21,
"rewrites": 76
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1111
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((((p320 <= 0) OR (p322 <= 0)) AND ((p108 <= 0) OR (p109 <= 0) OR (p112 <= 0)))))",
"processed_size": 89,
"rewrites": 76
},
"result":
{
"edges": 31,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F (G (((1 <= p261)))) OR ((1 <= p283)))))",
"processed_size": 48,
"rewrites": 76
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 3335
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3335
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p260 <= 0) OR (p261 <= 0) OR (p264 <= 0))",
"processed_size": 45,
"rewrites": 78
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p260 <= 0) OR (p261 <= 0) OR (p264 <= 0))",
"processed_size": 45,
"rewrites": 78
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p126) AND (1 <= p129))) AND (((1 <= p166)) AND ((1 <= p169)))))",
"processed_size": 77,
"rewrites": 76
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"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": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3808,
"runtime": 447.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : ((X(*) OR (G(F(**)) AND X(F(*)))) U G(**)) : G(F((F(G(**)) OR **))) : ((* R X(*)) OR (G(*) OR **)) : X(F(**)) : (G((F(**) AND (** AND **))) OR F(**)) : X((** AND (X(F(*)) OR (G(*) AND **)))) : (F(**) OR ((F(**) AND F(G(*))) OR (X(**) U **))) : (F(G(**)) OR ((** U X(**)) OR **)) : X(X(G((* R *)))) : ((((** U X(**)) OR (G(**) AND X(F(**)))) U **) AND (X(**) OR (G(**) AND X(F(**))))) : F(G(*)) : (X(**) AND G((G(F(**)) OR **)))"
},
"net":
{
"arcs": 1364,
"conflict_clusters": 83,
"places": 323,
"places_significant": 162,
"singleton_clusters": 0,
"transitions": 322
},
"result":
{
"preliminary_value": "no unknown no yes no no yes no no no no no no ",
"value": "no unknown no yes no no yes no no no 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: 645/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 323
lola: finding significant places
lola: 323 places, 322 transitions, 162 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: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p272 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p316 <= 1)
lola: LP says that atomic proposition is always true: (p317 <= 1)
lola: LP says that atomic proposition is always true: (p320 <= 1)
lola: LP says that atomic proposition is always true: (p316 <= 1)
lola: LP says that atomic proposition is always true: (p317 <= 1)
lola: LP says that atomic proposition is always true: (p320 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p242 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p299 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p242 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p299 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p320 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: G (F (NOT(G (F (NOT(X (G (((1 <= p183)))))))))) : ((X (F (G (F ((((1 <= p118) AND (1 <= p121)) U ((1 <= p73))))))) U NOT(X (((p268 <= 0) OR (p269 <= 0) OR (p272 <= 0))))) U G (((1 <= p268) AND (1 <= p269) AND (1 <= p272)))) : G (F ((X (X (NOT(G (F (NOT(X (G (((1 <= p261)))))))))) OR ((1 <= p283))))) : ((NOT((((1 <= p198) AND (1 <= p201)) U X (((1 <= p198) AND (1 <= p201))))) OR NOT(F ((F (((1 <= p6) AND (1 <= p9))) U ((1 <= p171) AND (1 <= p180) AND (1 <= p186)))))) OR ((1 <= p6) AND (1 <= p9))) : (X (((1 <= p125))) U F (X ((((X (((1 <= p260) AND (1 <= p261) AND (1 <= p264))) OR F (((1 <= p107)))) U ((p125 <= 0))) U ((1 <= p125)))))) : (G (((F (((1 <= p126) AND (1 <= p129))) AND ((1 <= p166))) AND ((1 <= p169)))) OR F (((1 <= p260) AND (1 <= p261) AND (1 <= p264)))) : X ((((p316 <= 0) OR (p317 <= 0) OR (p320 <= 0)) AND (NOT(X (G (((1 <= p316) AND (1 <= p317) AND (1 <= p320))))) OR (NOT(F (((1 <= p105)))) AND ((p190 <= 0) OR (p193 <= 0)))))) : ((NOT(G (F (((1 <= p256) AND (1 <= p258) AND (1 <= p263))))) U F (((1 <= p147)))) OR (X (((1 <= p87))) U ((1 <= p101)))) : ((F ((X (((1 <= p190) AND (1 <= p193))) U F (G (((1 <= p171) AND (1 <= p180) AND (1 <= p186)))))) OR (((1 <= p12) AND (1 <= p13) AND (1 <= p16)) U X (((1 <= p259))))) OR ((1 <= p171) AND (1 <= p180) AND (1 <= p186))) : X (G (X (NOT((((1 <= p289)) U ((1 <= p309))))))) : (((G (((1 <= p240) AND (1 <= p242) AND (1 <= p247))) U (((1 <= p299) AND (1 <= p308) AND (1 <= p314)) U X (((1 <= p240) AND (1 <= p242) AND (1 <= p247))))) U ((1 <= p299) AND (1 <= p308) AND (1 <= p314))) AND (G (((1 <= p159))) U X (((1 <= p159))))) : ((((1 <= p59)) U ((1 <= p108) AND (1 <= p109) AND (1 <= p112))) U G (NOT(G (F ((((1 <= p320) AND (1 <= p322)) OR ((1 <= p108) AND (1 <= p109) AND (1 <= p112)))))))) : (X (((1 <= p182) AND (1 <= p185))) AND G ((X (G (X (F (G (F (((1 <= p64) AND (1 <= p66) AND (1 <= p71)))))))) OR ((1 <= p214) AND (1 <= p217)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p268) AND (1 <= p269) AND (1 <= p272))) OR (G (F (((1 <= p73)))) AND X (F (((1 <= p268) AND (1 <= p269) AND (1 <= p272)))))) U G (((1 <= p268) AND (1 <= p269) AND (1 <= p272))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((1 <= p268) AND (1 <= p269) AND (1 <= p272))) OR (G (F (((1 <= p73)))) AND X (F (((1 <= p268) AND (1 <= p269) AND (1 <= p272)))))) U G (((1 <= p268) AND (1 <= p269) AND (1 <= p272))))
lola: processed formula length: 189
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 1412352 markings, 1412352 edges, 282470 markings/sec, 0 secs
lola: 2778684 markings, 2778684 edges, 273266 markings/sec, 5 secs
lola: 4109555 markings, 4109555 edges, 266174 markings/sec, 10 secs
lola: 5414456 markings, 5414455 edges, 260980 markings/sec, 15 secs
lola: 6712247 markings, 6712247 edges, 259558 markings/sec, 20 secs
lola: 7966681 markings, 7966680 edges, 250887 markings/sec, 25 secs
lola: 9240042 markings, 9240041 edges, 254672 markings/sec, 30 secs
lola: 10474626 markings, 10474626 edges, 246917 markings/sec, 35 secs
lola: 11727642 markings, 11727643 edges, 250603 markings/sec, 40 secs
lola: 12931884 markings, 12931885 edges, 240848 markings/sec, 45 secs
lola: 14164679 markings, 14164679 edges, 246559 markings/sec, 50 secs
lola: 15332522 markings, 15332522 edges, 233569 markings/sec, 55 secs
lola: 16566573 markings, 16566573 edges, 246810 markings/sec, 60 secs
lola: 17752312 markings, 17752312 edges, 237148 markings/sec, 65 secs
lola: 18884333 markings, 18884333 edges, 226404 markings/sec, 70 secs
lola: 20055586 markings, 20055585 edges, 234251 markings/sec, 75 secs
lola: 21260528 markings, 21260527 edges, 240988 markings/sec, 80 secs
lola: 22489536 markings, 22489536 edges, 245802 markings/sec, 85 secs
lola: 23714526 markings, 23714526 edges, 244998 markings/sec, 90 secs
lola: 24952734 markings, 24952733 edges, 247642 markings/sec, 95 secs
lola: 26150417 markings, 26150416 edges, 239537 markings/sec, 100 secs
lola: 27342350 markings, 27342350 edges, 238387 markings/sec, 105 secs
lola: 28541742 markings, 28541742 edges, 239878 markings/sec, 110 secs
lola: 29720463 markings, 29720463 edges, 235744 markings/sec, 115 secs
lola: 30901140 markings, 30901140 edges, 236135 markings/sec, 120 secs
lola: 32082361 markings, 32082360 edges, 236244 markings/sec, 125 secs
lola: 33032307 markings, 33032356 edges, 189989 markings/sec, 130 secs
lola: 33678919 markings, 33679335 edges, 129322 markings/sec, 135 secs
lola: 34453858 markings, 34455034 edges, 154988 markings/sec, 140 secs
lola: 35144249 markings, 35144249 edges, 138078 markings/sec, 145 secs
lola: 35819928 markings, 35819927 edges, 135136 markings/sec, 150 secs
lola: 36312659 markings, 36312659 edges, 98546 markings/sec, 155 secs
lola: 36751624 markings, 36751624 edges, 87793 markings/sec, 160 secs
lola: 37348362 markings, 37348362 edges, 119348 markings/sec, 165 secs
lola: 37901989 markings, 37901988 edges, 110725 markings/sec, 170 secs
lola: 38391388 markings, 38391388 edges, 97880 markings/sec, 175 secs
lola: 38938138 markings, 38938138 edges, 109350 markings/sec, 180 secs
lola: 39406851 markings, 39406851 edges, 93743 markings/sec, 185 secs
lola: 39926125 markings, 39926125 edges, 103855 markings/sec, 190 secs
lola: 40539009 markings, 40539009 edges, 122577 markings/sec, 195 secs
lola: 41069763 markings, 41069763 edges, 106151 markings/sec, 200 secs
lola: 41535784 markings, 41535784 edges, 93204 markings/sec, 205 secs
lola: 41766377 markings, 41766384 edges, 46119 markings/sec, 210 secs
lola: 41808310 markings, 41808316 edges, 8387 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p198 <= 0) OR (p201 <= 0)) R X (((p198 <= 0) OR (p201 <= 0)))) OR (G (((p171 <= 0) OR (p180 <= 0) OR (p186 <= 0))) OR ((1 <= p6) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) AND (1 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) AND (1 <= p9))
lola: processed formula length: 25
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p171 <= 0) OR (p180 <= 0) OR (p186 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p171 <= 0) OR (p180 <= 0) OR (p186 <= 0)))
lola: processed formula length: 49
lola: 76 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: 1086 markings, 1630 edges
lola: ========================================
lola: subprocess 3 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p198 <= 0) OR (p201 <= 0)) R X (((p198 <= 0) OR (p201 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p198 <= 0) OR (p201 <= 0)) R X (((p198 <= 0) OR (p201 <= 0))))
lola: processed formula length: 67
lola: 76 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: 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p125))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p125))))
lola: processed formula length: 21
lola: 76 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: 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: 342 markings, 342 edges
lola: ========================================
lola: subprocess 3 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p316 <= 0) OR (p317 <= 0) OR (p320 <= 0)) AND (X (F (((p316 <= 0) OR (p317 <= 0) OR (p320 <= 0)))) OR (G (((p105 <= 0))) AND ((p190 <= 0) OR (p193 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p316 <= 0) OR (p317 <= 0) OR (p320 <= 0)) AND (X (F (((p316 <= 0) OR (p317 <= 0) OR (p320 <= 0)))) OR (G (((p105 <= 0))) AND ((p190 <= 0) OR (p193 <= 0))))))
lola: processed formula length: 168
lola: 76 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: 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p147))) OR ((F (((1 <= p147))) AND F (G (((p256 <= 0) OR (p258 <= 0) OR (p263 <= 0))))) OR (X (((1 <= p87))) U ((1 <= p101)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p147)))
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: ((p147 <= 0))
lola: processed formula length: 13
lola: 78 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p87))) U ((1 <= p101)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p87))) U ((1 <= p101)))
lola: processed formula length: 34
lola: 76 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: 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: 254 markings, 254 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p171) AND (1 <= p180) AND (1 <= p186)))) OR ((((1 <= p12) AND (1 <= p13) AND (1 <= p16)) U X (((1 <= p259)))) OR ((1 <= p171) AND (1 <= p180) AND (1 <= p186))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p171) AND (1 <= p180) AND (1 <= p186))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p171) AND (1 <= p180) AND (1 <= p186))
lola: processed formula length: 45
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p171) AND (1 <= p180) AND (1 <= p186))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p171) AND (1 <= p180) AND (1 <= p186))))
lola: processed formula length: 53
lola: 76 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p12) AND (1 <= p13) AND (1 <= p16)) U X (((1 <= p259))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p12) AND (1 <= p13) AND (1 <= p16)) U X (((1 <= p259))))
lola: processed formula length: 64
lola: 76 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: 254 markings, 254 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 6 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p289 <= 0)) R ((p309 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p289 <= 0)) R ((p309 <= 0))))))
lola: processed formula length: 43
lola: 76 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: 254 markings, 254 edges
lola: ========================================
lola: subprocess 7 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((((1 <= p299) AND (1 <= p308) AND (1 <= p314)) U X (((1 <= p240) AND (1 <= p242) AND (1 <= p247)))) OR (G (((1 <= p240) AND (1 <= p242) AND (1 <= p247))) AND X (F (((1 <= p240) AND (1 <= p242) AND (1 <= p247)))))) U ((1 <= p299) AND (1 <= p308) AND (1 <= p314))) AND (X (((1 <= p159))) OR (G (((1 <= p159))) AND X (F (((1 <= p159)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p159)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p159)))
lola: processed formula length: 17
lola: 76 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p159)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p159)))
lola: processed formula length: 17
lola: 76 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: 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: 254 markings, 254 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p182) AND (1 <= p185))) AND G ((G (F (((1 <= p64) AND (1 <= p66) AND (1 <= p71)))) OR ((1 <= p214) AND (1 <= p217)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F (((1 <= p64) AND (1 <= p66) AND (1 <= p71)))) OR ((1 <= p214) AND (1 <= p217))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F (((1 <= p64) AND (1 <= p66) AND (1 <= p71)))) OR ((1 <= p214) AND (1 <= p217))))
lola: processed formula length: 89
lola: 76 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 833 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p183))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p183))))
lola: processed formula length: 21
lola: 76 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p320 <= 0) OR (p322 <= 0)) AND ((p108 <= 0) OR (p109 <= 0) OR (p112 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p320 <= 0) OR (p322 <= 0)) AND ((p108 <= 0) OR (p109 <= 0) OR (p112 <= 0)))))
lola: processed formula length: 89
lola: 76 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: 29 markings, 31 edges
lola: ========================================
lola: subprocess 11 will run for 1667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((1 <= p261)))) OR ((1 <= p283)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((1 <= p261)))) OR ((1 <= p283)))))
lola: processed formula length: 48
lola: 76 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: 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 3335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p126) AND (1 <= p129))) AND (((1 <= p166)) AND ((1 <= p169))))) OR F (((1 <= p260) AND (1 <= p261) AND (1 <= p264))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p260) AND (1 <= p261) AND (1 <= p264)))
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: ((p260 <= 0) OR (p261 <= 0) OR (p264 <= 0))
lola: processed formula length: 45
lola: 78 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: 5 markings, 5 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 <= p268) AND (1 <= p269) AND (1 <= p272))) OR (G (F (((1 <= p73)))) AND X (F (((1 <= p268) AND (1 <= p269) AND (1 <= p272)))))) U G (((1 <= p268) AND (1 <= p269) AND (1 <= p272))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((1 <= p268) AND (1 <= p269) AND (1 <= p272))) OR (G (F (((1 <= p73)))) AND X (F (((1 <= p268) AND (1 <= p269) AND (1 <= p272)))))) U G (((1 <= p268) AND (1 <= p269) AND (1 <= p272))))
lola: processed formula length: 189
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 1139476 markings, 1139476 edges, 227895 markings/sec, 0 secs
lola: 2439655 markings, 2439655 edges, 260036 markings/sec, 5 secs
lola: 3769403 markings, 3769403 edges, 265950 markings/sec, 10 secs
lola: 5072586 markings, 5072585 edges, 260637 markings/sec, 15 secs
lola: 6372329 markings, 6372328 edges, 259949 markings/sec, 20 secs
lola: 7623493 markings, 7623493 edges, 250233 markings/sec, 25 secs
lola: 8899986 markings, 8899986 edges, 255299 markings/sec, 30 secs
lola: 10158107 markings, 10158106 edges, 251624 markings/sec, 35 secs
lola: 11421256 markings, 11421255 edges, 252630 markings/sec, 40 secs
lola: 12683322 markings, 12683322 edges, 252413 markings/sec, 45 secs
lola: 13927759 markings, 13927759 edges, 248887 markings/sec, 50 secs
lola: 15154196 markings, 15154195 edges, 245287 markings/sec, 55 secs
lola: 16374871 markings, 16374871 edges, 244135 markings/sec, 60 secs
lola: 17619780 markings, 17619780 edges, 248982 markings/sec, 65 secs
lola: 18843684 markings, 18843684 edges, 244781 markings/sec, 70 secs
lola: 20060591 markings, 20060591 edges, 243381 markings/sec, 75 secs
lola: 21269423 markings, 21269423 edges, 241766 markings/sec, 80 secs
lola: 22506410 markings, 22506410 edges, 247397 markings/sec, 85 secs
lola: 23738639 markings, 23738639 edges, 246446 markings/sec, 90 secs
lola: 24991384 markings, 24991384 edges, 250549 markings/sec, 95 secs
lola: 26197190 markings, 26197189 edges, 241161 markings/sec, 100 secs
lola: 27400231 markings, 27400230 edges, 240608 markings/sec, 105 secs
lola: 28602075 markings, 28602075 edges, 240369 markings/sec, 110 secs
lola: 29791502 markings, 29791502 edges, 237885 markings/sec, 115 secs
lola: 30973487 markings, 30973487 edges, 236397 markings/sec, 120 secs
lola: 32126899 markings, 32126898 edges, 230682 markings/sec, 125 secs
lola: 33186854 markings, 33186876 edges, 211991 markings/sec, 130 secs
lola: 34053147 markings, 34055683 edges, 173259 markings/sec, 135 secs
lola: 34661747 markings, 34664332 edges, 121720 markings/sec, 140 secs
lola: 35463279 markings, 35463278 edges, 160306 markings/sec, 145 secs
lola: 35979273 markings, 35979272 edges, 103199 markings/sec, 150 secs
lola: 36397109 markings, 36397109 edges, 83567 markings/sec, 155 secs
lola: 37070236 markings, 37070235 edges, 134625 markings/sec, 160 secs
lola: 37721975 markings, 37721975 edges, 130348 markings/sec, 165 secs
lola: 38360471 markings, 38360471 edges, 127699 markings/sec, 170 secs
lola: 38988703 markings, 38988702 edges, 125646 markings/sec, 175 secs
lola: 39637413 markings, 39637413 edges, 129742 markings/sec, 180 secs
lola: 40187541 markings, 40187540 edges, 110026 markings/sec, 185 secs
lola: 40861623 markings, 40861623 edges, 134816 markings/sec, 190 secs
lola: 41365596 markings, 41365596 edges, 100795 markings/sec, 195 secs
lola: 41739168 markings, 41739167 edges, 74714 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p126) AND (1 <= p129))) AND (((1 <= p166)) AND ((1 <= p169))))) OR F (((1 <= p260) AND (1 <= p261) AND (1 <= p264))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (((1 <= p260) AND (1 <= p261) AND (1 <= p264)))
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: ((p260 <= 0) OR (p261 <= 0) OR (p264 <= 0))
lola: processed formula length: 45
lola: 78 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: 5 markings, 5 edges
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p126) AND (1 <= p129))) AND (((1 <= p166)) AND ((1 <= p169)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: ========================================
lola: processed formula: G ((F (((1 <= p126) AND (1 <= p129))) AND (((1 <= p166)) AND ((1 <= p169)))))
lola: processed formula length: 77
lola: 76 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no yes no no yes no no no no no no
lola:
preliminary result: no unknown no yes no no yes no no no no no no
lola: memory consumption: 3808 KB
lola: time consumption: 447 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="ShieldRVt-PT-040A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ShieldRVt-PT-040A, 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 r246-smll-162106594400154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040A.tgz
mv ShieldRVt-PT-040A 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 ;