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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K 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 110K 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.3K 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 15K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.0K 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-20480by10240-00
FORMULA_NAME CloudOpsManagement-PT-20480by10240-01
FORMULA_NAME CloudOpsManagement-PT-20480by10240-02
FORMULA_NAME CloudOpsManagement-PT-20480by10240-03
FORMULA_NAME CloudOpsManagement-PT-20480by10240-04
FORMULA_NAME CloudOpsManagement-PT-20480by10240-05
FORMULA_NAME CloudOpsManagement-PT-20480by10240-06
FORMULA_NAME CloudOpsManagement-PT-20480by10240-07
FORMULA_NAME CloudOpsManagement-PT-20480by10240-08
FORMULA_NAME CloudOpsManagement-PT-20480by10240-09
FORMULA_NAME CloudOpsManagement-PT-20480by10240-10
FORMULA_NAME CloudOpsManagement-PT-20480by10240-11
FORMULA_NAME CloudOpsManagement-PT-20480by10240-12
FORMULA_NAME CloudOpsManagement-PT-20480by10240-13
FORMULA_NAME CloudOpsManagement-PT-20480by10240-14
FORMULA_NAME CloudOpsManagement-PT-20480by10240-15

=== Now, execution of the tool begins

BK_START 1620903751303

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 11:02:33] [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:02:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:02:33] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-13 11:02:33] [INFO ] Transformed 27 places.
[2021-05-13 11:02:33] [INFO ] Transformed 29 transitions.
[2021-05-13 11:02:33] [INFO ] Parsed PT model containing 27 places and 29 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 102409 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=2133 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 11:02:34] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 11:02:34] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-13 11:02:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 11:02:34] [INFO ] [Real]Added 3 Read/Feed constraints in 9 ms returned sat
[2021-05-13 11:02:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 11:02:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:34] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 7 ms returned sat
[2021-05-13 11:02:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 10 ms.
[2021-05-13 11:02:34] [INFO ] Added : 25 causal constraints over 6 iterations in 72 ms. Result :sat
[2021-05-13 11:02:34] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:34] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Real]Added 3 Read/Feed constraints in 7 ms returned sat
[2021-05-13 11:02:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 14 ms.
[2021-05-13 11:02:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:34] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 11:02:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 11:02:34] [INFO ] Added : 25 causal constraints over 5 iterations in 60 ms. Result :sat
[2021-05-13 11:02:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Real]Added 3 Read/Feed constraints in 14 ms returned sat
[2021-05-13 11:02:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2021-05-13 11:02:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-13 11:02:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:02:34] [INFO ] Added : 25 causal constraints over 6 iterations in 29 ms. Result :sat
[2021-05-13 11:02:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 14 ms.
[2021-05-13 11:02:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 28 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 11:02:34] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:34] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 11:02:34] [INFO ] Added : 25 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 52 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:02:35] [INFO ] Added : 25 causal constraints over 6 iterations in 75 ms. Result :sat
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:35] [INFO ] Added : 25 causal constraints over 6 iterations in 20 ms. Result :sat
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 11:02:35] [INFO ] Added : 25 causal constraints over 6 iterations in 23 ms. Result :sat
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2021-05-13 11:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 11 ms.
[2021-05-13 11:02:35] [INFO ] Added : 25 causal constraints over 6 iterations in 30 ms. Result :sat
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Added 3 Read/Feed constraints in 13 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 64 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:35] [INFO ] Added : 25 causal constraints over 6 iterations in 47 ms. Result :sat
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:35] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:35] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:35] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Added : 25 causal constraints over 6 iterations in 25 ms. Result :sat
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using 11 positive place invariants in 77 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 33 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Added : 25 causal constraints over 6 iterations in 20 ms. Result :sat
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Added 3 Read/Feed constraints in 41 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 28 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Added : 25 causal constraints over 6 iterations in 40 ms. Result :sat
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 11:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:02:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 11:02:36] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 11:02:36] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 11:02:36] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 11:02:37] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 11:02:37] [INFO ] Flatten gal took : 37 ms
FORMULA CloudOpsManagement-PT-20480by10240-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-20480by10240-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:02:37] [INFO ] Flatten gal took : 8 ms
[2021-05-13 11:02:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 11:02:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-20480by10240 @ 3570 seconds

FORMULA CloudOpsManagement-PT-20480by10240-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-20480by10240-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3125
rslt: Output for LTLFireability @ CloudOpsManagement-PT-20480by10240

{
"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:02:37 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (G ((X (X (G (((1 <= p8) AND (1 <= p9))))) OR ((1 <= p8) AND (1 <= p9) AND (1 <= p18))))) OR ((1 <= p8) AND (1 <= p9))))",
"processed_size": 126,
"rewrites": 39
},
"result":
{
"edges": 21,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (((X (G (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) AND (1 <= p11)) OR (G ((1 <= p18)) OR F ((1 <= p18))))) AND (1 <= p11)))",
"processed_size": 130,
"rewrites": 39
},
"result":
{
"edges": 10245,
"markings": 10245,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (((p15 <= 0) AND F ((((1 <= p8) AND (1 <= p9)) OR (1 <= p15))))))",
"processed_size": 71,
"rewrites": 39
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p10) AND (1 <= p25)))",
"processed_size": 31,
"rewrites": 39
},
"result":
{
"edges": 10242,
"markings": 10242,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))",
"processed_size": 42,
"rewrites": 41
},
"result":
{
"edges": 61445,
"markings": 61445,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((1 <= p15) U ((G (F ((1 <= p24))) OR (G (F ((1 <= p24))) AND F (G ((1 <= p15))))) AND G ((1 <= p22)))))",
"processed_size": 107,
"rewrites": 39
},
"result":
{
"edges": 10245,
"markings": 10245,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 71
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p3 <= 0) OR (p4 <= 0))",
"processed_size": 25,
"rewrites": 41
},
"result":
{
"edges": 20481,
"markings": 20481,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3338
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "G ((F ((1 <= p15)) AND F ((1 <= p18))))",
"processed_size": 39,
"rewrites": 39
},
"result":
{
"edges": 61445,
"markings": 61445,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3188,
"runtime": 445.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F(G((X(X(G(**))) OR **))) OR **)) : (X(G(**)) OR (F(*) AND (F(G(*)) OR G(F(*))))) : F(G(*)) : F(**) : G((X(G(**)) AND (F(**) OR X(G(*))))) : X((X(((X(G(**)) AND **) OR (G(**) OR F(**)))) AND **)) : X(X((* AND F(*)))) : G((F(*) AND F(*))) : G(**) : (G(**) OR (X(X(G(**))) AND F(**))) : X((** U ((G(F(**)) OR (G(F(**)) AND F(G(**)))) AND G(**))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no unknown no no no no no no no no ",
"value": "no no unknown no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: F ((F (G ((X (X (G (((1 <= p8) AND (1 <= p9))))) OR ((1 <= p8) AND (1 <= p9) AND (1 <= p18))))) OR ((1 <= p8) AND (1 <= p9)))) : (G (X ((1 <= p24))) OR NOT((F (G (F ((1 <= p22)))) U G ((1 <= p24))))) : G (NOT(G (F (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))))) : (G (X (((1 <= p8) AND (1 <= p9)))) U F (((1 <= p3) AND (1 <= p4)))) : G ((X (G (((1 <= p11) AND (1 <= p12) AND (1 <= p25)))) AND (F (((1 <= p8) AND (1 <= p25))) OR NOT(F (X (((1 <= p11) AND (1 <= p12) AND (1 <= p25)))))))) : X ((X ((((X (G (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) AND (1 <= p11)) OR G ((1 <= p18))) OR F ((1 <= p18)))) AND (1 <= p11))) : X ((NOT(X ((1 <= p15))) AND NOT(X (G ((((p8 <= 0) OR (p9 <= 0)) AND (p15 <= 0))))))) : G ((NOT(G ((p15 <= 0))) AND NOT(G ((p18 <= 0))))) : G ((p24 <= 0)) : (G (((1 <= p10) AND (1 <= p25))) OR (X (G (X (((1 <= p10) AND (1 <= p25))))) AND F (((1 <= p13) AND (1 <= p17) AND (1 <= p21))))) : X (((1 <= p15) U ((F (G ((1 <= p15))) U G (X (F ((1 <= p24))))) AND G ((1 <= p22)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((X (X (G (((1 <= p8) AND (1 <= p9))))) OR ((1 <= p8) AND (1 <= p9) AND (1 <= p18))))) OR ((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 (G ((X (X (G (((1 <= p8) AND (1 <= p9))))) OR ((1 <= p8) AND (1 <= p9) AND (1 <= p18))))) OR ((1 <= p8) AND (1 <= p9))))
lola: processed formula length: 126
lola: 39 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 21 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p24))) OR (F ((p24 <= 0)) AND (F (G ((p22 <= 0))) OR G (F ((p24 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p24 <= 0)))
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 ((p24 <= 0)))
lola: processed formula length: 18
lola: 39 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: 174138 markings, 194675 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p24 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p24)
lola: processed formula length: 10
lola: 41 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p22 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p22 <= 0)))
lola: processed formula length: 18
lola: 39 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: 174118 markings, 194636 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p24)))
lola: processed formula length: 18
lola: 39 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10245 markings, 10245 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G (((1 <= p11) AND (1 <= p12) AND (1 <= p25)))) AND (F (((1 <= p8) AND (1 <= p25))) OR X (G (((p11 <= 0) OR (p12 <= 0) OR (p25 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G (((1 <= p11) AND (1 <= p12) AND (1 <= p25)))) AND (F (((1 <= p8) AND (1 <= p25))) OR X (G (((p11 <= 0) OR (p12 <= 0) OR (p25 <= 0)))))))
lola: processed formula length: 147
lola: 39 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: 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: 10245 markings, 10245 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((X (G (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) AND (1 <= p11)) OR (G ((1 <= p18)) OR F ((1 <= p18))))) AND (1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((X (G (((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) AND (1 <= p11)) OR (G ((1 <= p18)) OR F ((1 <= p18))))) AND (1 <= p11)))
lola: processed formula length: 130
lola: 39 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 10245 markings, 10245 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p15 <= 0) AND F ((((1 <= p8) AND (1 <= p9)) OR (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p15 <= 0) AND F ((((1 <= p8) AND (1 <= p9)) OR (1 <= p15))))))
lola: processed formula length: 71
lola: 39 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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p10) AND (1 <= p25))) OR (X (X (G (((1 <= p10) AND (1 <= p25))))) AND F (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p10) AND (1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p10) AND (1 <= p25)))
lola: processed formula length: 31
lola: 39 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: 10242 markings, 10242 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))
lola: processed formula length: 42
lola: 41 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 61445 markings, 61445 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p15) U ((G (F ((1 <= p24))) OR (G (F ((1 <= p24))) AND F (G ((1 <= p15))))) AND G ((1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p15) U ((G (F ((1 <= p24))) OR (G (F ((1 <= p24))) AND F (G ((1 <= p15))))) AND G ((1 <= p22)))))
lola: processed formula length: 107
lola: 39 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 71 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: 10245 markings, 10245 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p3) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p3 <= 0) OR (p4 <= 0))
lola: processed formula length: 25
lola: 41 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 20481 markings, 20481 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0))))
lola: processed formula length: 48
lola: 39 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: 3893546 markings, 8016447 edges, 778709 markings/sec, 0 secs
lola: 7624942 markings, 15710588 edges, 746279 markings/sec, 5 secs
lola: 11262830 markings, 23215270 edges, 727578 markings/sec, 10 secs
lola: 14864855 markings, 30644239 edges, 720405 markings/sec, 15 secs
lola: 18426625 markings, 37989663 edges, 712354 markings/sec, 20 secs
lola: 21928694 markings, 45214475 edges, 700414 markings/sec, 25 secs
lola: 25446249 markings, 52469146 edges, 703511 markings/sec, 30 secs
lola: 28914747 markings, 59621139 edges, 693700 markings/sec, 35 secs
lola: 32410238 markings, 66832242 edges, 699098 markings/sec, 40 secs
lola: 35891350 markings, 74014517 edges, 696222 markings/sec, 45 secs
lola: 39363290 markings, 81173458 edges, 694388 markings/sec, 50 secs
lola: 42775832 markings, 88213541 edges, 682508 markings/sec, 55 secs
lola: 46142396 markings, 95152723 edges, 673313 markings/sec, 60 secs
lola: 49505926 markings, 102093484 edges, 672706 markings/sec, 65 secs
lola: 52928604 markings, 109153474 edges, 684536 markings/sec, 70 secs
lola: 56345946 markings, 116200236 edges, 683468 markings/sec, 75 secs
lola: 59759980 markings, 123239970 edges, 682807 markings/sec, 80 secs
lola: 63175285 markings, 130282403 edges, 683061 markings/sec, 85 secs
lola: 66578840 markings, 137304063 edges, 680711 markings/sec, 90 secs
lola: 69967212 markings, 144295308 edges, 677674 markings/sec, 95 secs
lola: 73354492 markings, 151278188 edges, 677456 markings/sec, 100 secs
lola: 76712917 markings, 158206977 edges, 671685 markings/sec, 105 secs
lola: 80077049 markings, 165143689 edges, 672826 markings/sec, 110 secs
lola: 83389811 markings, 171978456 edges, 662552 markings/sec, 115 secs
lola: 86696169 markings, 178797996 edges, 661272 markings/sec, 120 secs
lola: 89999756 markings, 185609929 edges, 660717 markings/sec, 125 secs
lola: 93259044 markings, 192333266 edges, 651858 markings/sec, 130 secs
lola: 96601036 markings, 199222677 edges, 668398 markings/sec, 135 secs
lola: 99956792 markings, 206148521 edges, 671151 markings/sec, 140 secs
lola: 103312021 markings, 213063739 edges, 671046 markings/sec, 145 secs
lola: 106657865 markings, 219968655 edges, 669169 markings/sec, 150 secs
lola: 110000305 markings, 226881029 edges, 668488 markings/sec, 155 secs
lola: 110360077 markings, 227605694 edges, 71954 markings/sec, 160 secs
lola: 112944484 markings, 232932971 edges, 516881 markings/sec, 165 secs
lola: 115679349 markings, 238577220 edges, 546973 markings/sec, 170 secs
lola: 118290324 markings, 243962159 edges, 522195 markings/sec, 175 secs
lola: 121180002 markings, 249916624 edges, 577936 markings/sec, 180 secs
lola: 123663558 markings, 255040545 edges, 496711 markings/sec, 185 secs
lola: 125113488 markings, 258029467 edges, 289986 markings/sec, 190 secs
lola: 128073281 markings, 264134665 edges, 591959 markings/sec, 195 secs
lola: 131020839 markings, 270213863 edges, 589512 markings/sec, 200 secs
lola: 133745910 markings, 275835783 edges, 545014 markings/sec, 205 secs
lola: 136645772 markings, 281818606 edges, 579972 markings/sec, 210 secs
lola: 137668921 markings, 283927521 edges, 204630 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p24 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p24 <= 0))
lola: processed formula length: 14
lola: 39 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: 174139 markings, 194676 edges
lola: ========================================
lola: subprocess 10 will run for 3338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p15)) AND F ((1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p15)) AND F ((1 <= p18))))
lola: processed formula length: 39
lola: 39 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: 61445 markings, 61445 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0))))
lola: processed formula length: 48
lola: 39 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: 3900305 markings, 8030808 edges, 780061 markings/sec, 0 secs
lola: 7616255 markings, 15693214 edges, 743190 markings/sec, 5 secs
lola: 11141571 markings, 22967836 edges, 705063 markings/sec, 10 secs
lola: 14757202 markings, 30425580 edges, 723126 markings/sec, 15 secs
lola: 18316674 markings, 37764265 edges, 711894 markings/sec, 20 secs
lola: 21839365 markings, 45030140 edges, 704538 markings/sec, 25 secs
lola: 25348135 markings, 52265697 edges, 701754 markings/sec, 30 secs
lola: 28782725 markings, 59349110 edges, 686918 markings/sec, 35 secs
lola: 32262096 markings, 66527683 edges, 695874 markings/sec, 40 secs
lola: 35755791 markings, 73733224 edges, 698739 markings/sec, 45 secs
lola: 39238161 markings, 80912960 edges, 696474 markings/sec, 50 secs
lola: 42692387 markings, 88036539 edges, 690845 markings/sec, 55 secs
lola: 46094090 markings, 95054814 edges, 680341 markings/sec, 60 secs
lola: 49422316 markings, 101917703 edges, 665645 markings/sec, 65 secs
lola: 52804675 markings, 108895741 edges, 676472 markings/sec, 70 secs
lola: 56231662 markings, 115964717 edges, 685397 markings/sec, 75 secs
lola: 59637786 markings, 122990551 edges, 681225 markings/sec, 80 secs
lola: 63052803 markings, 130032371 edges, 683003 markings/sec, 85 secs
lola: 66465711 markings, 137069711 edges, 682582 markings/sec, 90 secs
lola: 69855896 markings, 144062938 edges, 678037 markings/sec, 95 secs
lola: 73248119 markings, 151062381 edges, 678445 markings/sec, 100 secs
lola: 76613406 markings, 157998533 edges, 673057 markings/sec, 105 secs
lola: 79980842 markings, 164947586 edges, 673487 markings/sec, 110 secs
lola: 83272125 markings, 171734913 edges, 658257 markings/sec, 115 secs
lola: 86581086 markings, 178557592 edges, 661792 markings/sec, 120 secs
lola: 89893611 markings, 185389339 edges, 662505 markings/sec, 125 secs
lola: 93240472 markings, 192296121 edges, 669372 markings/sec, 130 secs
lola: 96590826 markings, 199201591 edges, 670071 markings/sec, 135 secs
lola: 99939700 markings, 206112492 edges, 669775 markings/sec, 140 secs
lola: 103283635 markings, 213006966 edges, 668787 markings/sec, 145 secs
lola: 106620719 markings, 219889723 edges, 667417 markings/sec, 150 secs
lola: 109963940 markings, 226787335 edges, 668644 markings/sec, 155 secs
lola: 112779265 markings, 232600620 edges, 563065 markings/sec, 160 secs
lola: 115515957 markings, 238239014 edges, 547338 markings/sec, 165 secs
lola: 118448839 markings, 244287025 edges, 586576 markings/sec, 170 secs
lola: 121352389 markings, 250272708 edges, 580710 markings/sec, 175 secs
lola: 124196459 markings, 256142233 edges, 568814 markings/sec, 180 secs
lola: 127099303 markings, 262126416 edges, 580569 markings/sec, 185 secs
lola: 129962918 markings, 268034327 edges, 572723 markings/sec, 190 secs
lola: 132862339 markings, 274014381 edges, 579884 markings/sec, 195 secs
lola: 135774411 markings, 280018172 edges, 582414 markings/sec, 200 secs
lola: 137749487 markings, 284092302 edges, 395015 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown no no no no no no no no
lola:
preliminary result: no no unknown no no no no no no no no
lola: memory consumption: 3188 KB
lola: time consumption: 445 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-20480by10240"
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-20480by10240, 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-162038334800234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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