Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334800230.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 CloudOpsManagement-PT-10240by05120, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334800230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 28K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 185K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 22 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 17K May 5 16:51 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 CloudOpsManagement-PT-10240by05120-00
FORMULA_NAME CloudOpsManagement-PT-10240by05120-01
FORMULA_NAME CloudOpsManagement-PT-10240by05120-02
FORMULA_NAME CloudOpsManagement-PT-10240by05120-03
FORMULA_NAME CloudOpsManagement-PT-10240by05120-04
FORMULA_NAME CloudOpsManagement-PT-10240by05120-05
FORMULA_NAME CloudOpsManagement-PT-10240by05120-06
FORMULA_NAME CloudOpsManagement-PT-10240by05120-07
FORMULA_NAME CloudOpsManagement-PT-10240by05120-08
FORMULA_NAME CloudOpsManagement-PT-10240by05120-09
FORMULA_NAME CloudOpsManagement-PT-10240by05120-10
FORMULA_NAME CloudOpsManagement-PT-10240by05120-11
FORMULA_NAME CloudOpsManagement-PT-10240by05120-12
FORMULA_NAME CloudOpsManagement-PT-10240by05120-13
FORMULA_NAME CloudOpsManagement-PT-10240by05120-14
FORMULA_NAME CloudOpsManagement-PT-10240by05120-15

=== Now, execution of the tool begins

BK_START 1620903636866

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 11:00:42] [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-13 11:00:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:00:42] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2021-05-13 11:00:42] [INFO ] Transformed 27 places.
[2021-05-13 11:00:42] [INFO ] Transformed 29 transitions.
[2021-05-13 11:00:42] [INFO ] Parsed PT model containing 27 places and 29 transitions in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 107537 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=1097 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 11:00:42] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-13 11:00:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 11:00:43] [INFO ] [Real]Added 3 Read/Feed constraints in 21 ms returned sat
[2021-05-13 11:00:43] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 13 ms.
[2021-05-13 11:00:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:43] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 11:00:43] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2021-05-13 11:00:43] [INFO ] Added : 25 causal constraints over 6 iterations in 45 ms. Result :sat
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-13 11:00:43] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:00:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:43] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:43] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 11:00:43] [INFO ] Added : 25 causal constraints over 5 iterations in 19 ms. Result :sat
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:43] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 22 ms returned sat
[2021-05-13 11:00:43] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:43] [INFO ] Added : 25 causal constraints over 6 iterations in 64 ms. Result :sat
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:00:43] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:43] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:43] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:00:43] [INFO ] Added : 25 causal constraints over 5 iterations in 145 ms. Result :sat
[2021-05-13 11:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:44] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:44] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 11:00:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:44] [INFO ] Added : 25 causal constraints over 6 iterations in 24 ms. Result :sat
[2021-05-13 11:00:44] [INFO ] [Real]Absence check using 11 positive place invariants in 56 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Real]Added 3 Read/Feed constraints in 16 ms returned sat
[2021-05-13 11:00:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:00:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 28 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:44] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 11:00:44] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:44] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2021-05-13 11:00:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 40 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-13 11:00:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:44] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 11:00:44] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 65 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:44] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2021-05-13 11:00:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 26 ms returned sat
[2021-05-13 11:00:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:45] [INFO ] Added : 25 causal constraints over 6 iterations in 190 ms. Result :sat
[2021-05-13 11:00:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:00:45] [INFO ] [Real]Added 3 Read/Feed constraints in 16 ms returned sat
[2021-05-13 11:00:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:00:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 11:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:45] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-13 11:00:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 26 ms returned sat
[2021-05-13 11:00:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 11:00:45] [INFO ] Added : 25 causal constraints over 6 iterations in 82 ms. Result :sat
[2021-05-13 11:00:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:45] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 11:00:45] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:00:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:00:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 45 ms returned sat
[2021-05-13 11:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:45] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 26 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:00:46] [INFO ] Added : 25 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:00:46] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 33 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:46] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:00:46] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:46] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:00:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 11:00:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:00:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 28 ms.
[2021-05-13 11:00:46] [INFO ] Added : 25 causal constraints over 6 iterations in 44 ms. Result :sat
[2021-05-13 11:00:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 11:00:46] [INFO ] Flatten gal took : 40 ms
FORMULA CloudOpsManagement-PT-10240by05120-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:00:46] [INFO ] Flatten gal took : 6 ms
[2021-05-13 11:00:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 11:00:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-10240by05120 @ 3570 seconds

FORMULA CloudOpsManagement-PT-10240by05120-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2601
rslt: Output for LTLFireability @ CloudOpsManagement-PT-10240by05120

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 11:00:47 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X ((1 <= p15)) AND (1 <= p20)))",
"processed_size": 35,
"rewrites": 120
},
"result":
{
"edges": 5125,
"markings": 5125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 264
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p8) AND (1 <= p9)) U (((1 <= p8) AND (1 <= p9)) U ((p8 <= 0) OR (p9 <= 0))))",
"processed_size": 85,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 286
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (((1 <= p8) AND (1 <= p9))))",
"processed_size": 33,
"rewrites": 120
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 286
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 2,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G ((p18 <= 0)) OR (X (G ((1 <= p18))) U (((1 <= p11) AND (1 <= p12) AND (1 <= p25)) U X ((1 <= p11))))))",
"processed_size": 108,
"rewrites": 120
},
"result":
{
"edges": 5126,
"markings": 5126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"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": 312
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((F ((((1 <= p8) AND (1 <= p9)) OR (G ((1 <= p14)) AND F (((1 <= p8) AND (1 <= p9)))))) OR X (X (((1 <= p8) AND (1 <= p9))))) R ((1 <= p8) AND (1 <= p9))))",
"processed_size": 158,
"rewrites": 120
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 21
},
"compoundnumber": 4,
"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": 344
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 416
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 <= p24) U X (X ((p22 <= 0))))",
"processed_size": 33,
"rewrites": 120
},
"result":
{
"edges": 57,
"markings": 49,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (X (G ((p14 <= 0)))) OR G (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))",
"processed_size": 78,
"rewrites": 120
},
"result":
{
"edges": 5134,
"markings": 5131,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 416
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 416
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((1 <= p14) OR (p10 <= 0) OR (p25 <= 0)))",
"processed_size": 46,
"rewrites": 120
},
"result":
{
"edges": 30725,
"markings": 30725,
"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": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "X (F (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0))))",
"processed_size": 48,
"rewrites": 120
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 619
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))",
"processed_size": 50,
"rewrites": 120
},
"result":
{
"edges": 30727,
"markings": 30726,
"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": 773
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((G ((1 <= p15)) OR (F ((1 <= p15)) OR (1 <= p15)))))",
"processed_size": 58,
"rewrites": 120
},
"result":
{
"edges": 30727,
"markings": 30726,
"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": 1031
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"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": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p10) AND (1 <= p25))) AND ((1 <= p24) OR ((1 <= p10) AND (1 <= p25))))))",
"processed_size": 89,
"rewrites": 120
},
"result":
{
"edges": 5126,
"markings": 5125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G (((p1 <= 0) OR (p2 <= 0))) AND (p15 <= 0)))",
"processed_size": 50,
"rewrites": 120
},
"result":
{
"edges": 604109,
"markings": 307179,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3094
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p18)))",
"processed_size": 18,
"rewrites": 120
},
"result":
{
"edges": 30725,
"markings": 30725,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 <= p24) U X (X ((p22 <= 0))))",
"processed_size": 33,
"rewrites": 120
},
"result":
{
"edges": 57,
"markings": 49,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p18)))",
"processed_size": 18,
"rewrites": 120
},
"result":
{
"edges": 30725,
"markings": 30725,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p8) AND (1 <= p9))) AND (1 <= p18)))",
"processed_size": 50,
"rewrites": 120
},
"result":
{
"edges": 39395819,
"markings": 26255351,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 20,
"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": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3576,
"runtime": 969.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F((G(**) AND **)) OR (G(F(**)) AND F((G(**) AND **)))) : (X(X((* R *))) AND F((X(**) AND *))) : G((G(*) AND *)) : F(G((F(**) AND (** OR **)))) : F(G(**)) : X((F((G(F(**)) OR **)) U X(F(**)))) : (X(X(**)) AND (** U (** U **))) : X((G(*) OR (X(G(**)) U (** U X(**))))) : F(((F((** OR (G(**) AND F(**)))) OR X(X(**))) R *)) : G(F((G(**) OR (F(**) OR **)))) : (X(G(*)) AND ((** U X(X(*))) OR **)) : G((X(X(G(*))) OR G(**))) : (X(F(**)) OR (G(**) AND (** AND (** AND (** AND (** AND (** AND **))))))) : X(X((F(G((* R *))) OR (** OR **)))) : G(F((X(G(*)) OR *)))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no no no no unknown no no no no unknown no yes unknown unknown ",
"value": "no no no no no unknown no no no no unknown no yes unknown unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 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: (1 <= p16)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: (G (F ((1 <= p18))) U F ((G (((1 <= p8) AND (1 <= p9))) AND (1 <= p18)))) : (NOT(X (X (((1 <= p20) U (1 <= p15))))) AND NOT(G ((NOT(X ((1 <= p15))) OR (p20 <= 0))))) : NOT(F ((F (((1 <= p1) AND (1 <= p2))) OR (1 <= p15)))) : X (F (NOT(F (X (NOT(G (((1 <= p24) U ((1 <= p10) AND (1 <= p25)))))))))) : F (G (F (X (G (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))))) : (X (F ((F (G (F (((1 <= p8) AND (1 <= p9))))) OR (1 <= p2)))) U F (X (X ((1 <= p22))))) : (X (X (((1 <= p8) AND (1 <= p9)))) AND (((1 <= p8) AND (1 <= p9)) U (((1 <= p8) AND (1 <= p9)) U ((p8 <= 0) OR (p9 <= 0))))) : (X (NOT(F ((1 <= p18)))) OR X ((G (X (G ((1 <= p18)))) U (((1 <= p11) AND (1 <= p12) AND (1 <= p25)) U X ((1 <= p11)))))) : F (NOT(((NOT(F ((G ((1 <= p14)) U ((1 <= p8) AND (1 <= p9))))) AND NOT(X (X (((1 <= p8) AND (1 <= p9)))))) U ((p8 <= 0) OR (p9 <= 0))))) : G ((F ((G ((1 <= p15)) OR F ((1 <= p15)))) OR F ((1 <= p15)))) : (NOT(X (F (((p8 <= 0) OR (p9 <= 0))))) AND (((1 <= p24) U X (NOT(X ((1 <= p22))))) OR (1 <= p24))) : G ((NOT(F (X (X ((1 <= p14))))) OR G (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))) : (F (X (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0)))) OR ((((((G (((1 <= p14) OR (p10 <= 0) OR (p25 <= 0))) AND (1 <= p5)) AND (1 <= p7)) AND (1 <= p26)) AND (1 <= p13)) AND (1 <= p17)) AND (1 <= p21))) : X (X (((F (G (NOT((((1 <= p13)) U ((1 <= p3) AND (1 <= p4)))))) OR (p8 <= 0)) OR (p25 <= 0)))) : G (NOT(G ((X ((((1 <= p21)) U F ((1 <= p22)))) AND (p15 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((p20 <= 0) R (p15 <= 0)))) AND F ((X ((1 <= p15)) AND (1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((1 <= p15)) AND (1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((1 <= p15)) AND (1 <= p20)))
lola: processed formula length: 35
lola: 120 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: 5125 markings, 5125 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((G (F (((1 <= p8) AND (1 <= p9)))) OR (1 <= p2))) U X (F ((1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G (F (((1 <= p8) AND (1 <= p9)))) OR (1 <= p2))) U X (F ((1 <= p22)))))
lola: processed formula length: 79
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5059584 markings, 7625689 edges, 1011917 markings/sec, 0 secs
lola: 9852218 markings, 14836314 edges, 958527 markings/sec, 5 secs
lola: 14620524 markings, 22006889 edges, 953661 markings/sec, 10 secs
lola: 19297667 markings, 29038523 edges, 935429 markings/sec, 15 secs
lola: 23853192 markings, 35886361 edges, 911105 markings/sec, 20 secs
lola: 28376007 markings, 42683714 edges, 904563 markings/sec, 25 secs
lola: 32798028 markings, 49329372 edges, 884404 markings/sec, 30 secs
lola: 37215239 markings, 55966910 edges, 883442 markings/sec, 35 secs
lola: 41743487 markings, 62770840 edges, 905650 markings/sec, 40 secs
lola: 46220312 markings, 69497142 edges, 895365 markings/sec, 45 secs
lola: 50470289 markings, 75882281 edges, 849995 markings/sec, 50 secs
lola: 54692587 markings, 82225749 edges, 844460 markings/sec, 55 secs
lola: 58972131 markings, 88654820 edges, 855909 markings/sec, 60 secs
lola: 63257395 markings, 95092061 edges, 857053 markings/sec, 65 secs
lola: 67364326 markings, 101261596 edges, 821386 markings/sec, 70 secs
lola: 71395986 markings, 107317521 edges, 806332 markings/sec, 75 secs
lola: 72373146 markings, 108785262 edges, 195432 markings/sec, 80 secs
lola: 72688790 markings, 109260866 edges, 63129 markings/sec, 85 secs
lola: 75846358 markings, 114004467 edges, 631514 markings/sec, 90 secs
lola: 78692156 markings, 118278356 edges, 569160 markings/sec, 95 secs
lola: 82431640 markings, 123894634 edges, 747897 markings/sec, 100 secs
lola: 85472004 markings, 128460330 edges, 608073 markings/sec, 105 secs
lola: 88398907 markings, 132857420 edges, 585381 markings/sec, 110 secs
lola: 89917798 markings, 135137898 edges, 303778 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((1 <= p8) AND (1 <= p9)))) AND (((1 <= p8) AND (1 <= p9)) U (((1 <= p8) AND (1 <= p9)) U ((p8 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p8) AND (1 <= p9)) U (((1 <= p8) AND (1 <= p9)) U ((p8 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p8) AND (1 <= p9)) U (((1 <= p8) AND (1 <= p9)) U ((p8 <= 0) OR (p9 <= 0))))
lola: processed formula length: 85
lola: 120 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p8) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p8) AND (1 <= p9))))
lola: processed formula length: 33
lola: 120 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p18 <= 0)) OR (X (G ((1 <= p18))) U (((1 <= p11) AND (1 <= p12) AND (1 <= p25)) U X ((1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p18 <= 0)) OR (X (G ((1 <= p18))) U (((1 <= p11) AND (1 <= p12) AND (1 <= p25)) U X ((1 <= p11))))))
lola: processed formula length: 108
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 5126 markings, 5126 edges
lola: ========================================
lola: subprocess 4 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((F ((((1 <= p8) AND (1 <= p9)) OR (G ((1 <= p14)) AND F (((1 <= p8) AND (1 <= p9)))))) OR X (X (((1 <= p8) AND (1 <= p9))))) R ((1 <= p8) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((F ((((1 <= p8) AND (1 <= p9)) OR (G ((1 <= p14)) AND F (((1 <= p8) AND (1 <= p9)))))) OR X (X (((1 <= p8) AND (1 <= p9))))) R ((1 <= p8) AND (1 <= p9))))
lola: processed formula length: 158
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 5 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p8) AND (1 <= p9)))) AND (((1 <= p24) U X (X ((p22 <= 0)))) OR (1 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p8) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p8) AND (1 <= p9))))
lola: processed formula length: 33
lola: 120 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: 5102530 markings, 7690289 edges, 1020506 markings/sec, 0 secs
lola: 9921924 markings, 14941152 edges, 963879 markings/sec, 5 secs
lola: 14616124 markings, 22000249 edges, 938840 markings/sec, 10 secs
lola: 19284909 markings, 29019411 edges, 933757 markings/sec, 15 secs
lola: 23916238 markings, 35980974 edges, 926266 markings/sec, 20 secs
lola: 28489973 markings, 42855183 edges, 914747 markings/sec, 25 secs
lola: 33044216 markings, 49699296 edges, 910849 markings/sec, 30 secs
lola: 37524842 markings, 56432154 edges, 896125 markings/sec, 35 secs
lola: 42111426 markings, 63323800 edges, 917317 markings/sec, 40 secs
lola: 46677917 markings, 70184719 edges, 913298 markings/sec, 45 secs
lola: 51310326 markings, 77144446 edges, 926482 markings/sec, 50 secs
lola: 55912087 markings, 84057785 edges, 920352 markings/sec, 55 secs
lola: 60378749 markings, 90767787 edges, 893332 markings/sec, 60 secs
lola: 64848670 markings, 97482447 edges, 893984 markings/sec, 65 secs
lola: 69253605 markings, 104099471 edges, 880987 markings/sec, 70 secs
lola: 73404477 markings, 110338183 edges, 830174 markings/sec, 75 secs
lola: 77280928 markings, 116193012 edges, 775290 markings/sec, 80 secs
lola: 81174420 markings, 122005854 edges, 778698 markings/sec, 85 secs
lola: 85045249 markings, 127836558 edges, 774166 markings/sec, 90 secs
lola: 88885144 markings, 133586879 edges, 767979 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p24)
lola: processed formula length: 10
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 7 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p24) U X (X ((p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p24) U X (X ((p22 <= 0))))
lola: processed formula length: 33
lola: 120 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: 49 markings, 57 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 6 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (G ((p14 <= 0)))) OR G (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (G ((p14 <= 0)))) OR G (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))
lola: processed formula length: 78
lola: 120 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5131 markings, 5134 edges
lola: ========================================
lola: subprocess 7 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0)))) OR (G (((1 <= p14) OR (p10 <= 0) OR (p25 <= 0))) AND ((1 <= p5) AND ((1 <= p7) AND ((1 <= p26) AND ((1 <= p13) AND ((1 <= p17) AND (1 <= p21))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p14) OR (p10 <= 0) OR (p25 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p14) OR (p10 <= 0) OR (p25 <= 0)))
lola: processed formula length: 46
lola: 120 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: 30725 markings, 30725 edges
lola: ========================================
lola: subprocess 8 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0))))
lola: processed formula length: 48
lola: 120 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (G ((((p13 <= 0)) R ((p3 <= 0) OR (p4 <= 0))))) OR ((p8 <= 0) OR (p25 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (G ((((p13 <= 0)) R ((p3 <= 0) OR (p4 <= 0))))) OR ((p8 <= 0) OR (p25 <= 0)))))
lola: processed formula length: 89
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5139182 markings, 7745539 edges, 1027836 markings/sec, 0 secs
lola: 10041173 markings, 15120446 edges, 980398 markings/sec, 5 secs
lola: 14900815 markings, 22428393 edges, 971928 markings/sec, 10 secs
lola: 19666928 markings, 29593724 edges, 953223 markings/sec, 15 secs
lola: 24330474 markings, 36603671 edges, 932709 markings/sec, 20 secs
lola: 29036415 markings, 43676404 edges, 941188 markings/sec, 25 secs
lola: 33732369 markings, 50733276 edges, 939191 markings/sec, 30 secs
lola: 38361570 markings, 57689381 edges, 925840 markings/sec, 35 secs
lola: 43071166 markings, 64765796 edges, 941919 markings/sec, 40 secs
lola: 47708684 markings, 71733362 edges, 927504 markings/sec, 45 secs
lola: 52331377 markings, 78678364 edges, 924539 markings/sec, 50 secs
lola: 56911298 markings, 85558860 edges, 915984 markings/sec, 55 secs
lola: 61478187 markings, 92419360 edges, 913378 markings/sec, 60 secs
lola: 66079547 markings, 99331689 edges, 920272 markings/sec, 65 secs
lola: 70633399 markings, 106171992 edges, 910770 markings/sec, 70 secs
lola: 74772557 markings, 112389913 edges, 827832 markings/sec, 75 secs
lola: 78717475 markings, 118315814 edges, 788984 markings/sec, 80 secs
lola: 82486838 markings, 123976772 edges, 753873 markings/sec, 85 secs
lola: 86282497 markings, 129677702 edges, 759132 markings/sec, 90 secs
lola: 89776142 markings, 134925104 edges, 698729 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G ((p22 <= 0))) OR (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G ((p22 <= 0))) OR (1 <= p15))))
lola: processed formula length: 42
lola: 120 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: 4456875 markings, 6683638 edges, 891375 markings/sec, 0 secs
lola: 8770209 markings, 13153021 edges, 862667 markings/sec, 5 secs
lola: 13031338 markings, 19545569 edges, 852226 markings/sec, 10 secs
lola: 17160829 markings, 25740531 edges, 825898 markings/sec, 15 secs
lola: 21414949 markings, 32121814 edges, 850824 markings/sec, 20 secs
lola: 25719008 markings, 38577913 edges, 860812 markings/sec, 25 secs
lola: 29681882 markings, 46225788 edges, 792575 markings/sec, 30 secs
lola: 33291085 markings, 53445934 edges, 721841 markings/sec, 35 secs
lola: 36879675 markings, 60621042 edges, 717718 markings/sec, 40 secs
lola: 40394348 markings, 67652088 edges, 702935 markings/sec, 45 secs
lola: 43982032 markings, 74828670 edges, 717537 markings/sec, 50 secs
lola: 47542793 markings, 81949624 edges, 712152 markings/sec, 55 secs
lola: 51134375 markings, 89132887 edges, 718316 markings/sec, 60 secs
lola: 54987893 markings, 96824213 edges, 770704 markings/sec, 65 secs
lola: 58627390 markings, 104103610 edges, 727899 markings/sec, 70 secs
lola: 62214520 markings, 111275681 edges, 717426 markings/sec, 75 secs
lola: 65735672 markings, 118319985 edges, 704230 markings/sec, 80 secs
lola: 69178155 markings, 125204456 edges, 688497 markings/sec, 85 secs
lola: 72659178 markings, 132167210 edges, 696205 markings/sec, 90 secs
lola: 76198187 markings, 139246396 edges, 707802 markings/sec, 95 secs
lola: 79300602 markings, 145435692 edges, 620483 markings/sec, 100 secs
lola: 82434257 markings, 151701110 edges, 626731 markings/sec, 105 secs
lola: 85534008 markings, 157904109 edges, 619950 markings/sec, 110 secs
lola: 88584995 markings, 164003222 edges, 610197 markings/sec, 115 secs
lola: 91686200 markings, 170206124 edges, 620241 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))
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 <= p13) AND (1 <= p17) AND (1 <= p21))))
lola: processed formula length: 50
lola: 120 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: add low 3
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: 30726 markings, 30727 edges
lola: ========================================
lola: subprocess 11 will run for 773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p15)) OR (F ((1 <= p15)) OR (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p15)) OR (F ((1 <= p15)) OR (1 <= p15)))))
lola: processed formula length: 58
lola: 120 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: add low 3
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: 30726 markings, 30727 edges
lola: ========================================
lola: subprocess 12 will run for 1031 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p10) AND (1 <= p25))) AND ((1 <= p24) OR ((1 <= p10) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p10) AND (1 <= p25))) AND ((1 <= p24) OR ((1 <= p10) AND (1 <= p25))))))
lola: processed formula length: 89
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 28
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: 5125 markings, 5126 edges
lola: ========================================
lola: subprocess 13 will run for 1547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p1 <= 0) OR (p2 <= 0))) AND (p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p1 <= 0) OR (p2 <= 0))) AND (p15 <= 0)))
lola: processed formula length: 50
lola: 120 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: 307179 markings, 604109 edges
lola: ========================================
lola: subprocess 14 will run for 3094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((1 <= p8) AND (1 <= p9))) AND (1 <= p18))) OR (G (F ((1 <= p18))) AND F ((G (((1 <= p8) AND (1 <= p9))) AND (1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p18)))
lola: processed formula length: 18
lola: 120 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: 30725 markings, 30725 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 ((F ((G (F (((1 <= p8) AND (1 <= p9)))) OR (1 <= p2))) U X (F ((1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G (F (((1 <= p8) AND (1 <= p9)))) OR (1 <= p2))) U X (F ((1 <= p22)))))
lola: processed formula length: 79
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4999271 markings, 7534887 edges, 999854 markings/sec, 0 secs
lola: 9771596 markings, 14715083 edges, 954465 markings/sec, 5 secs
lola: 14483371 markings, 21800611 edges, 942355 markings/sec, 10 secs
lola: 19159729 markings, 28831283 edges, 935272 markings/sec, 15 secs
lola: 23749014 markings, 35729523 edges, 917857 markings/sec, 20 secs
lola: 28332274 markings, 42618067 edges, 916652 markings/sec, 25 secs
lola: 32867516 markings, 49433751 edges, 907048 markings/sec, 30 secs
lola: 37351497 markings, 56171698 edges, 896796 markings/sec, 35 secs
lola: 41935872 markings, 63060084 edges, 916875 markings/sec, 40 secs
lola: 46444927 markings, 69834900 edges, 901811 markings/sec, 45 secs
lola: 50924339 markings, 76564602 edges, 895882 markings/sec, 50 secs
lola: 55350807 markings, 83214533 edges, 885294 markings/sec, 55 secs
lola: 59750186 markings, 89823758 edges, 879876 markings/sec, 60 secs
lola: 64257222 markings, 96594248 edges, 901407 markings/sec, 65 secs
lola: 68701212 markings, 103269760 edges, 888798 markings/sec, 70 secs
lola: 72985254 markings, 109705516 edges, 856808 markings/sec, 75 secs
lola: 76669314 markings, 115240996 edges, 736812 markings/sec, 80 secs
lola: 80422800 markings, 120885731 edges, 750697 markings/sec, 85 secs
lola: 84232577 markings, 126598833 edges, 761955 markings/sec, 90 secs
lola: 88052224 markings, 132335884 edges, 763929 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p8) AND (1 <= p9)))) AND (((1 <= p24) U X (X ((p22 <= 0)))) OR (1 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p8) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p8) AND (1 <= p9))))
lola: processed formula length: 33
lola: 120 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: 5052519 markings, 7615031 edges, 1010504 markings/sec, 0 secs
lola: 9901665 markings, 14910639 edges, 969829 markings/sec, 5 secs
lola: 14716596 markings, 22151529 edges, 962986 markings/sec, 10 secs
lola: 19459056 markings, 29281140 edges, 948492 markings/sec, 15 secs
lola: 24167578 markings, 36358707 edges, 941704 markings/sec, 20 secs
lola: 28812205 markings, 43339251 edges, 928925 markings/sec, 25 secs
lola: 33397024 markings, 50229515 edges, 916964 markings/sec, 30 secs
lola: 37923644 markings, 57031500 edges, 905324 markings/sec, 35 secs
lola: 42569160 markings, 64011525 edges, 929103 markings/sec, 40 secs
lola: 47151576 markings, 70896424 edges, 916483 markings/sec, 45 secs
lola: 51745299 markings, 77798047 edges, 918745 markings/sec, 50 secs
lola: 56262669 markings, 84584549 edges, 903474 markings/sec, 55 secs
lola: 60612324 markings, 91118849 edges, 869931 markings/sec, 60 secs
lola: 65171774 markings, 97968058 edges, 911890 markings/sec, 65 secs
lola: 69656035 markings, 104703895 edges, 896852 markings/sec, 70 secs
lola: 73828364 markings, 110972705 edges, 834466 markings/sec, 75 secs
lola: 76354161 markings, 114766646 edges, 505159 markings/sec, 80 secs
lola: 80052628 markings, 120322600 edges, 739693 markings/sec, 85 secs
lola: 83732050 markings, 125858455 edges, 735884 markings/sec, 90 secs
lola: 86923787 markings, 130640775 edges, 638347 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (1 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p24)
lola: processed formula length: 10
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p24) U X (X ((p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p24) U X (X ((p22 <= 0))))
lola: processed formula length: 33
lola: 120 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: 49 markings, 57 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X ((F (G ((((p13 <= 0)) R ((p3 <= 0) OR (p4 <= 0))))) OR ((p8 <= 0) OR (p25 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (G ((((p13 <= 0)) R ((p3 <= 0) OR (p4 <= 0))))) OR ((p8 <= 0) OR (p25 <= 0)))))
lola: processed formula length: 89
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4974122 markings, 7497097 edges, 994824 markings/sec, 0 secs
lola: 9878712 markings, 14876202 edges, 980918 markings/sec, 5 secs
lola: 14753578 markings, 22207067 edges, 974973 markings/sec, 10 secs
lola: 19508821 markings, 29355970 edges, 951049 markings/sec, 15 secs
lola: 24236172 markings, 36461864 edges, 945470 markings/sec, 20 secs
lola: 28901744 markings, 43473993 edges, 933114 markings/sec, 25 secs
lola: 33553615 markings, 50464593 edges, 930374 markings/sec, 30 secs
lola: 38089123 markings, 57279948 edges, 907102 markings/sec, 35 secs
lola: 42645989 markings, 64126784 edges, 911373 markings/sec, 40 secs
lola: 47139343 markings, 70878136 edges, 898671 markings/sec, 45 secs
lola: 51579349 markings, 77548673 edges, 888001 markings/sec, 50 secs
lola: 55961240 markings, 84131509 edges, 876378 markings/sec, 55 secs
lola: 60251585 markings, 90576906 edges, 858069 markings/sec, 60 secs
lola: 64684068 markings, 97235467 edges, 886497 markings/sec, 65 secs
lola: 69069247 markings, 103822571 edges, 877036 markings/sec, 70 secs
lola: 73239920 markings, 110087871 edges, 834135 markings/sec, 75 secs
lola: 76730764 markings, 115331726 edges, 698169 markings/sec, 80 secs
lola: 79817596 markings, 119967481 edges, 617366 markings/sec, 85 secs
lola: 83508715 markings, 125529174 edges, 738224 markings/sec, 90 secs
lola: 86907616 markings, 130616465 edges, 679780 markings/sec, 95 secs
lola: 89835857 markings, 135014896 edges, 585648 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((X (G ((p22 <= 0))) OR (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G ((p22 <= 0))) OR (1 <= p15))))
lola: processed formula length: 42
lola: 120 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: 4542735 markings, 6812237 edges, 908547 markings/sec, 0 secs
lola: 8904188 markings, 13354810 edges, 872291 markings/sec, 5 secs
lola: 13342190 markings, 20012536 edges, 887600 markings/sec, 10 secs
lola: 17611418 markings, 26416610 edges, 853846 markings/sec, 15 secs
lola: 21834124 markings, 32750239 edges, 844541 markings/sec, 20 secs
lola: 26086401 markings, 39129515 edges, 850455 markings/sec, 25 secs
lola: 29951933 markings, 46767682 edges, 773106 markings/sec, 30 secs
lola: 33523596 markings, 53907619 edges, 714333 markings/sec, 35 secs
lola: 37095984 markings, 61055813 edges, 714478 markings/sec, 40 secs
lola: 40596023 markings, 68056288 edges, 700008 markings/sec, 45 secs
lola: 44137596 markings, 75138625 edges, 708315 markings/sec, 50 secs
lola: 47675475 markings, 82215191 edges, 707576 markings/sec, 55 secs
lola: 51260210 markings, 89384519 edges, 716947 markings/sec, 60 secs
lola: 55094194 markings, 97036053 edges, 766797 markings/sec, 65 secs
lola: 58778345 markings, 104404342 edges, 736830 markings/sec, 70 secs
lola: 62363996 markings, 111576372 edges, 717130 markings/sec, 75 secs
lola: 65886642 markings, 118621965 edges, 704529 markings/sec, 80 secs
lola: 69383423 markings, 125613557 edges, 699356 markings/sec, 85 secs
lola: 72947123 markings, 132742307 edges, 712740 markings/sec, 90 secs
lola: 76460645 markings, 139772711 edges, 702704 markings/sec, 95 secs
lola: 79276877 markings, 145386434 edges, 563246 markings/sec, 100 secs
lola: 82259747 markings, 151353922 edges, 596574 markings/sec, 105 secs
lola: 85213865 markings, 157259517 edges, 590824 markings/sec, 110 secs
lola: 87972525 markings, 162777248 edges, 551732 markings/sec, 115 secs
lola: 90682688 markings, 168197697 edges, 542033 markings/sec, 120 secs
lola: 93282819 markings, 173399141 edges, 520026 markings/sec, 125 secs
lola: 93718254 markings, 174267983 edges, 87087 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((G (((1 <= p8) AND (1 <= p9))) AND (1 <= p18))) OR (G (F ((1 <= p18))) AND F ((G (((1 <= p8) AND (1 <= p9))) AND (1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p18)))
lola: processed formula length: 18
lola: 120 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: 30725 markings, 30725 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p8) AND (1 <= p9))) AND (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p8) AND (1 <= p9))) AND (1 <= p18)))
lola: processed formula length: 50
lola: 120 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: 4271018 markings, 6410323 edges, 854204 markings/sec, 0 secs
lola: 8381555 markings, 12579267 edges, 822107 markings/sec, 5 secs
lola: 12383609 markings, 18584049 edges, 800411 markings/sec, 10 secs
lola: 16310265 markings, 24476813 edges, 785331 markings/sec, 15 secs
lola: 20296227 markings, 30455580 edges, 797192 markings/sec, 20 secs
lola: 24163639 markings, 36259418 edges, 773482 markings/sec, 25 secs
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: 26255351 markings, 39395819 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no unknown no no no no unknown no yes unknown unknown
lola:
preliminary result: no no no no no unknown no no no no unknown no yes unknown unknown
lola: memory consumption: 3576 KB
lola: time consumption: 969 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="CloudOpsManagement-PT-10240by05120"
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 CloudOpsManagement-PT-10240by05120, 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 r056-oct2-162038334800230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-10240by05120.tgz
mv CloudOpsManagement-PT-10240by05120 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 ;