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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.1K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:50 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-01280by00640-00
FORMULA_NAME CloudOpsManagement-PT-01280by00640-01
FORMULA_NAME CloudOpsManagement-PT-01280by00640-02
FORMULA_NAME CloudOpsManagement-PT-01280by00640-03
FORMULA_NAME CloudOpsManagement-PT-01280by00640-04
FORMULA_NAME CloudOpsManagement-PT-01280by00640-05
FORMULA_NAME CloudOpsManagement-PT-01280by00640-06
FORMULA_NAME CloudOpsManagement-PT-01280by00640-07
FORMULA_NAME CloudOpsManagement-PT-01280by00640-08
FORMULA_NAME CloudOpsManagement-PT-01280by00640-09
FORMULA_NAME CloudOpsManagement-PT-01280by00640-10
FORMULA_NAME CloudOpsManagement-PT-01280by00640-11
FORMULA_NAME CloudOpsManagement-PT-01280by00640-12
FORMULA_NAME CloudOpsManagement-PT-01280by00640-13
FORMULA_NAME CloudOpsManagement-PT-01280by00640-14
FORMULA_NAME CloudOpsManagement-PT-01280by00640-15

=== Now, execution of the tool begins

BK_START 1620903085300

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:51:26] [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 10:51:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:51:26] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-13 10:51:26] [INFO ] Transformed 27 places.
[2021-05-13 10:51:26] [INFO ] Transformed 29 transitions.
[2021-05-13 10:51:26] [INFO ] Parsed PT model containing 27 places and 29 transitions in 52 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 100600 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=2395 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:51:26] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:51:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 6 iterations in 37 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 5 iterations in 27 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 6 iterations in 19 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 6 iterations in 17 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 6 iterations in 18 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2021-05-13 10:51:27] [INFO ] Added : 14 causal constraints over 3 iterations in 40 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 5 iterations in 14 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 6 iterations in 16 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:27] [INFO ] Added : 25 causal constraints over 6 iterations in 23 ms. Result :sat
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 1 ms.
[2021-05-13 10:51:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 10:51:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:27] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2021-05-13 10:51:28] [INFO ] Added : 25 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 10:51:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 10:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:28] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-13 10:51:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:51:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:51:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 10:51:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:51:28] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:51:28] [INFO ] Added : 25 causal constraints over 6 iterations in 15 ms. Result :sat
[2021-05-13 10:51:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 10:51:28] [INFO ] Flatten gal took : 23 ms
FORMULA CloudOpsManagement-PT-01280by00640-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:51:28] [INFO ] Flatten gal took : 5 ms
[2021-05-13 10:51:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 10:51:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-01280by00640 @ 3570 seconds

FORMULA CloudOpsManagement-PT-01280by00640-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-01280by00640-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2694
rslt: Output for LTLFireability @ CloudOpsManagement-PT-01280by00640

{
"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 10:51:28 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 246
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p0 <= 0) OR (p26 <= 0)) R (1 <= p20))",
"processed_size": 41,
"rewrites": 46
},
"result":
{
"edges": 3845,
"markings": 3845,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((1 <= p0) AND (1 <= p26)))))",
"processed_size": 38,
"rewrites": 46
},
"result":
{
"edges": 20,
"markings": 18,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "X (((1 <= p15) OR G ((X (X ((p15 <= 0))) R ((p8 <= 0) OR (p9 <= 0))))))",
"processed_size": 72,
"rewrites": 46
},
"result":
{
"edges": 645,
"markings": 645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 287
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 313
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((X (F ((1 <= p2))) OR ((p8 <= 0) OR (p9 <= 0))))",
"processed_size": 51,
"rewrites": 46
},
"result":
{
"edges": 645,
"markings": 645,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 313
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (X (F (((1 <= p3) AND (1 <= p4))))) OR ((1 <= p20) OR ((1 <= p3) AND (1 <= p4)))))",
"processed_size": 88,
"rewrites": 46
},
"result":
{
"edges": 645,
"markings": 645,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 345
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 2,
"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": 5,
"visible_transitions": 0
},
"processed": "X (((((1 <= p0) AND (1 <= p26)) U ((p8 <= 0) OR (p9 <= 0))) AND ((X (((1 <= p8) AND (1 <= p9))) OR (1 <= p15)) U (1 <= p15))))",
"processed_size": 127,
"rewrites": 46
},
"result":
{
"edges": 645,
"markings": 645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 383
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "((1 <= p7) U (G (F ((1 <= p7))) AND X ((1 <= p7))))",
"processed_size": 51,
"rewrites": 46
},
"result":
{
"edges": 645,
"markings": 645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((F (((1 <= p10) AND (1 <= p25))) AND G (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) U X (((1 <= p10) AND (1 <= p25))))",
"processed_size": 120,
"rewrites": 46
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((X ((1 <= p15)) AND (G (((1 <= p21))) OR (p15 <= 0)))))",
"processed_size": 61,
"rewrites": 46
},
"result":
{
"edges": 645,
"markings": 645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((1 <= p8) AND (1 <= p25))))",
"processed_size": 34,
"rewrites": 46
},
"result":
{
"edges": 10870,
"markings": 5758,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 834
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p10) AND (1 <= p25) AND (1 <= p22)) OR (G ((F ((1 <= p24)) OR (G ((1 <= p24)) AND F ((1 <= p24))))) AND F (((1 <= p10) AND (1 <= p25) AND (1 <= p22)))))))",
"processed_size": 168,
"rewrites": 46
},
"result":
{
"edges": 650,
"markings": 648,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 30
},
"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": 1112
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((((p0 <= 0) OR (p26 <= 0)) R ((p8 <= 0) OR (p9 <= 0))) OR (1 <= p14)))",
"processed_size": 76,
"rewrites": 46
},
"result":
{
"edges": 3845,
"markings": 3845,
"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": 3128
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3128
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p24 <= 0) AND (1 <= p8) AND (1 <= p9))",
"processed_size": 40,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"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": 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": "((p24 <= 0) AND (1 <= p8) AND (1 <= p9))",
"processed_size": 40,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((p8 <= 0) OR (p9 <= 0)))",
"processed_size": 29,
"rewrites": 46
},
"result":
{
"edges": 3845,
"markings": 3845,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3676,
"runtime": 876.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(((F(**) OR **) U G(**))) U **) : ((* R *) OR X(X(F(**)))) : X((** OR G((X(X(**)) R *)))) : F(G((** OR (G((F(**) OR (G(**) AND F(**)))) AND F(**))))) : F(((** U G(**)) AND G(**))) : (F(**) AND X((X(F(**)) OR (** OR **)))) : F((X(X(F(**))) OR (** OR **))) : G(F(**)) : X(((** U **) AND ((X(*) OR **) U **))) : (** U (G(F(**)) AND X(**))) : (G(*) OR **) : G(((* R *) OR **)) : ((F(**) AND G(**)) U X(**)) : F((X(G(*)) OR F((X(**) AND G(**))))) : G(F((X(**) AND (G(**) OR **))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "unknown yes no no unknown no no no no no no no yes unknown no ",
"value": "unknown yes no no unknown no no no no no no no yes unknown 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: LP says that atomic proposition is always true: (1 <= p16)
lola: LP says that atomic proposition is always true: (1 <= p16)
lola: LP says that atomic proposition is always true: (1 <= p23)
lola: ((X ((F (((1 <= p8) AND (1 <= p9))) OR (1 <= p18))) U X (G (((1 <= p8) AND (1 <= p9))))) U (1 <= p18)) : (NOT((((1 <= p0) AND (1 <= p26)) U (p20 <= 0))) OR X (F (X (F (((1 <= p0) AND (1 <= p26))))))) : (X ((1 <= p15)) OR G (NOT(X ((NOT(X (X ((p15 <= 0)))) U ((1 <= p8) AND (1 <= p9))))))) : G (F (G ((G ((G ((1 <= p24)) U F ((1 <= p24)))) U ((1 <= p10) AND (1 <= p25) AND (1 <= p22)))))) : F (((((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0)) U G (((p3 <= 0) OR (p4 <= 0) OR (p24 <= 0)))) AND G (((p3 <= 0) OR (p4 <= 0))))) : (F (((p13 <= 0) OR (1 <= p2))) AND X (((F (X ((1 <= p2))) OR (p8 <= 0)) OR (p9 <= 0)))) : F (((X (F (X (((1 <= p3) AND (1 <= p4))))) OR (1 <= p20)) OR ((1 <= p3) AND (1 <= p4)))) : X (G (X (X (F (X (((1 <= p8) AND (1 <= p25)))))))) : X (((((1 <= p0) AND (1 <= p26)) U ((p8 <= 0) OR (p9 <= 0))) AND ((NOT(X (((p8 <= 0) OR (p9 <= 0)))) OR (1 <= p15)) U (1 <= p15)))) : ((1 <= p7) U (G (F ((1 <= p7))) AND X ((1 <= p7)))) : (NOT(((1 <= p24) U F (((1 <= p8) AND (1 <= p9))))) OR ((p24 <= 0) AND (1 <= p8) AND (1 <= p9))) : G ((NOT((((1 <= p0) AND (1 <= p26)) U ((1 <= p8) AND (1 <= p9)))) OR (1 <= p14))) : ((F (((1 <= p10) AND (1 <= p25))) AND G (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) U X (((1 <= p10) AND (1 <= p25)))) : F ((G (NOT(X (((1 <= p8) AND (1 <= p25))))) OR F ((X (((p13 <= 0))) AND G (((1 <= p8) AND (1 <= p25))))))) : G (X (F ((X ((1 <= p15)) AND (G (((1 <= p21))) OR (p15 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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 (((F (((1 <= p8) AND (1 <= p9))) OR (1 <= p18)) U G (((1 <= p8) AND (1 <= p9))))) U (1 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((F (((1 <= p8) AND (1 <= p9))) OR (1 <= p18)) U G (((1 <= p8) AND (1 <= p9))))) U (1 <= p18))
lola: processed formula length: 98
lola: 46 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: 4843213 markings, 7302321 edges, 968643 markings/sec, 0 secs
lola: 9502413 markings, 14312454 edges, 931840 markings/sec, 5 secs
lola: 14212439 markings, 21395578 edges, 942005 markings/sec, 10 secs
lola: 18874771 markings, 28405083 edges, 932466 markings/sec, 15 secs
lola: 23425403 markings, 35245538 edges, 910126 markings/sec, 20 secs
lola: 27926758 markings, 42010994 edges, 900271 markings/sec, 25 secs
lola: 32373897 markings, 48694107 edges, 889428 markings/sec, 30 secs
lola: 36781247 markings, 55317115 edges, 881470 markings/sec, 35 secs
lola: 41246862 markings, 62027140 edges, 893123 markings/sec, 40 secs
lola: 45673033 markings, 68677218 edges, 885234 markings/sec, 45 secs
lola: 50054395 markings, 75259824 edges, 876272 markings/sec, 50 secs
lola: 54428250 markings, 81831718 edges, 874771 markings/sec, 55 secs
lola: 58764142 markings, 88344583 edges, 867178 markings/sec, 60 secs
lola: 63150842 markings, 94934312 edges, 877340 markings/sec, 65 secs
lola: 67503249 markings, 101472407 edges, 870481 markings/sec, 70 secs
lola: 71818047 markings, 107953834 edges, 862960 markings/sec, 75 secs
lola: 73368530 markings, 110283769 edges, 310097 markings/sec, 80 secs
lola: 76269299 markings, 114642033 edges, 580154 markings/sec, 85 secs
lola: 79901381 markings, 120096614 edges, 726416 markings/sec, 90 secs
lola: 83316445 markings, 125224920 edges, 683013 markings/sec, 95 secs
lola: 86953753 markings, 130688080 edges, 727462 markings/sec, 100 secs
lola: 89903106 markings, 135118103 edges, 589871 markings/sec, 105 secs
lola: 89961508 markings, 135205781 edges, 11680 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p0 <= 0) OR (p26 <= 0)) R (1 <= p20)) OR X (X (F (((1 <= p0) AND (1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p0 <= 0) OR (p26 <= 0)) R (1 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p0 <= 0) OR (p26 <= 0)) R (1 <= p20))
lola: processed formula length: 41
lola: 46 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: 3845 markings, 3845 edges
lola: ========================================
lola: subprocess 2 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p0) AND (1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p0) AND (1 <= p26)))))
lola: processed formula length: 38
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 18 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p15) OR G ((X (X ((p15 <= 0))) R ((p8 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p15) OR G ((X (X ((p15 <= 0))) R ((p8 <= 0) OR (p9 <= 0))))))
lola: processed formula length: 72
lola: 46 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: 645 markings, 645 edges
lola: ========================================
lola: subprocess 3 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p13 <= 0) OR (1 <= p2))) AND X ((X (F ((1 <= p2))) OR ((p8 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p13 <= 0) OR (1 <= p2)))
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: ((1 <= p13) AND (p2 <= 0))
lola: processed formula length: 26
lola: 48 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 4 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((1 <= p2))) OR ((p8 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((1 <= p2))) OR ((p8 <= 0) OR (p9 <= 0))))
lola: processed formula length: 51
lola: 46 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: 645 markings, 645 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F (((1 <= p3) AND (1 <= p4))))) OR ((1 <= p20) OR ((1 <= p3) AND (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F (((1 <= p3) AND (1 <= p4))))) OR ((1 <= p20) OR ((1 <= p3) AND (1 <= p4)))))
lola: processed formula length: 88
lola: 46 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: 645 markings, 645 edges
lola: ========================================
lola: subprocess 5 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p0) AND (1 <= p26)) U ((p8 <= 0) OR (p9 <= 0))) AND ((X (((1 <= p8) AND (1 <= p9))) OR (1 <= p15)) U (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p0) AND (1 <= p26)) U ((p8 <= 0) OR (p9 <= 0))) AND ((X (((1 <= p8) AND (1 <= p9))) OR (1 <= p15)) U (1 <= p15))))
lola: processed formula length: 127
lola: 46 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: 645 markings, 645 edges
lola: ========================================
lola: subprocess 6 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p7) U (G (F ((1 <= p7))) AND X ((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p7) U (G (F ((1 <= p7))) AND X ((1 <= p7))))
lola: processed formula length: 51
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 645 markings, 645 edges
lola: ========================================
lola: subprocess 7 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p10) AND (1 <= p25))) AND G (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) U X (((1 <= p10) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p10) AND (1 <= p25))) AND G (((1 <= p13) AND (1 <= p17) AND (1 <= p21)))) U X (((1 <= p10) AND (1 <= p25))))
lola: processed formula length: 120
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((p8 <= 0) OR (p25 <= 0)))) OR F ((X (((p13 <= 0))) AND G (((1 <= p8) AND (1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((p8 <= 0) OR (p25 <= 0)))) OR F ((X (((p13 <= 0))) AND G (((1 <= p8) AND (1 <= p25)))))))
lola: processed formula length: 101
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4880957 markings, 7359054 edges, 976191 markings/sec, 0 secs
lola: 9633007 markings, 14508855 edges, 950410 markings/sec, 5 secs
lola: 14345057 markings, 21595031 edges, 942410 markings/sec, 10 secs
lola: 19027769 markings, 28635145 edges, 936542 markings/sec, 15 secs
lola: 23669138 markings, 35611841 edges, 928274 markings/sec, 20 secs
lola: 28207822 markings, 42433341 edges, 907737 markings/sec, 25 secs
lola: 32759868 markings, 49274228 edges, 910409 markings/sec, 30 secs
lola: 37222883 markings, 55980611 edges, 892603 markings/sec, 35 secs
lola: 41802072 markings, 62861228 edges, 915838 markings/sec, 40 secs
lola: 46256252 markings, 69553458 edges, 890836 markings/sec, 45 secs
lola: 50698742 markings, 76227911 edges, 888498 markings/sec, 50 secs
lola: 55104933 markings, 82847577 edges, 881238 markings/sec, 55 secs
lola: 59432306 markings, 89348448 edges, 865475 markings/sec, 60 secs
lola: 63887405 markings, 96040815 edges, 891020 markings/sec, 65 secs
lola: 68288025 markings, 102651201 edges, 880124 markings/sec, 70 secs
lola: 72552933 markings, 109058802 edges, 852982 markings/sec, 75 secs
lola: 76270263 markings, 114642086 edges, 743466 markings/sec, 80 secs
lola: 79892532 markings, 120083960 edges, 724454 markings/sec, 85 secs
lola: 83553851 markings, 125581703 edges, 732264 markings/sec, 90 secs
lola: 86328127 markings, 129748462 edges, 554855 markings/sec, 95 secs
lola: 88309577 markings, 132724762 edges, 396290 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((1 <= p15)) AND (G (((1 <= p21))) OR (p15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((1 <= p15)) AND (G (((1 <= p21))) OR (p15 <= 0)))))
lola: processed formula length: 61
lola: 46 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: 645 markings, 645 edges
lola: ========================================
lola: subprocess 10 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p8) AND (1 <= p25))))
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 <= p8) AND (1 <= p25))))
lola: processed formula length: 34
lola: 46 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: 5758 markings, 10870 edges
lola: ========================================
lola: subprocess 11 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p10) AND (1 <= p25) AND (1 <= p22)) OR (G ((F ((1 <= p24)) OR (G ((1 <= p24)) AND F ((1 <= p24))))) AND F (((1 <= p10) AND (1 <= p25) AND (1 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p10) AND (1 <= p25) AND (1 <= p22)) OR (G ((F ((1 <= p24)) OR (G ((1 <= p24)) AND F ((1 <= p24))))) AND F (((1 <= p10) AND (1 <= p25) AND (1 <= p22)))))))
lola: processed formula length: 168
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 30 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 26
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: 648 markings, 650 edges
lola: ========================================
lola: subprocess 12 will run for 1112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((p0 <= 0) OR (p26 <= 0)) R ((p8 <= 0) OR (p9 <= 0))) OR (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p0 <= 0) OR (p26 <= 0)) R ((p8 <= 0) OR (p9 <= 0))) OR (1 <= p14)))
lola: processed formula length: 76
lola: 46 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: 3845 markings, 3845 edges
lola: ========================================
lola: subprocess 13 will run for 1668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0)) U G (((p3 <= 0) OR (p4 <= 0) OR (p24 <= 0)))) AND G (((p3 <= 0) OR (p4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0)) U G (((p3 <= 0) OR (p4 <= 0) OR (p24 <= 0)))) AND G (((p3 <= 0) OR (p4 <= 0)))))
lola: processed formula length: 129
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 3027837 markings, 7832682 edges, 605567 markings/sec, 0 secs
lola: 5578080 markings, 15552285 edges, 510049 markings/sec, 5 secs
lola: 8081732 markings, 23132475 edges, 500730 markings/sec, 10 secs
lola: 10543146 markings, 30585264 edges, 492283 markings/sec, 15 secs
lola: 12994966 markings, 38011201 edges, 490364 markings/sec, 20 secs
lola: 15416090 markings, 45340290 edges, 484225 markings/sec, 25 secs
lola: 17822469 markings, 52623691 edges, 481276 markings/sec, 30 secs
lola: 20214544 markings, 59868704 edges, 478415 markings/sec, 35 secs
lola: 22599453 markings, 67088805 edges, 476982 markings/sec, 40 secs
lola: 24966282 markings, 74254205 edges, 473366 markings/sec, 45 secs
lola: 27323115 markings, 81390814 edges, 471367 markings/sec, 50 secs
lola: 29676208 markings, 88515864 edges, 470619 markings/sec, 55 secs
lola: 32029138 markings, 95639162 edges, 470586 markings/sec, 60 secs
lola: 34368656 markings, 102717911 edges, 467904 markings/sec, 65 secs
lola: 36684910 markings, 109735779 edges, 463251 markings/sec, 70 secs
lola: 39023096 markings, 116809786 edges, 467637 markings/sec, 75 secs
lola: 41353979 markings, 123871530 edges, 466177 markings/sec, 80 secs
lola: 43657888 markings, 130845282 edges, 460782 markings/sec, 85 secs
lola: 45933108 markings, 137735509 edges, 455044 markings/sec, 90 secs
lola: 48797764 markings, 145067897 edges, 572931 markings/sec, 95 secs
lola: 51940527 markings, 152460144 edges, 628553 markings/sec, 100 secs
lola: 54970115 markings, 159591000 edges, 605918 markings/sec, 105 secs
lola: 57989602 markings, 166685437 edges, 603897 markings/sec, 110 secs
lola: 60961214 markings, 173674282 edges, 594322 markings/sec, 115 secs
lola: 63912934 markings, 180623020 edges, 590344 markings/sec, 120 secs
lola: 66863406 markings, 187559043 edges, 590094 markings/sec, 125 secs
lola: 70219161 markings, 195159996 edges, 671151 markings/sec, 130 secs
lola: 74423847 markings, 204142748 edges, 840937 markings/sec, 135 secs
lola: 78585452 markings, 213033810 edges, 832321 markings/sec, 140 secs
lola: 82767581 markings, 222107161 edges, 836426 markings/sec, 145 secs
lola: 86913760 markings, 230997615 edges, 829236 markings/sec, 150 secs
lola: 90980312 markings, 239687245 edges, 813310 markings/sec, 155 secs
lola: 95149430 markings, 248594808 edges, 833824 markings/sec, 160 secs
lola: 99084411 markings, 257002857 edges, 786996 markings/sec, 165 secs
lola: 102721661 markings, 264776529 edges, 727450 markings/sec, 170 secs
lola: 106345215 markings, 272517264 edges, 724711 markings/sec, 175 secs
lola: 109968487 markings, 280259243 edges, 724654 markings/sec, 180 secs
lola: 113696614 markings, 288225172 edges, 745625 markings/sec, 185 secs
lola: 117388102 markings, 296113387 edges, 738298 markings/sec, 190 secs
lola: 121021259 markings, 303875798 edges, 726631 markings/sec, 195 secs
lola: 124559210 markings, 311435893 edges, 707590 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 3128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p8 <= 0) OR (p9 <= 0))) OR ((p24 <= 0) AND (1 <= p8) AND (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p24 <= 0) AND (1 <= p8) AND (1 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p24 <= 0) AND (1 <= p8) AND (1 <= p9))
lola: processed formula length: 40
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 (((1 <= p8) AND (1 <= p9))) OR (1 <= p18)) U G (((1 <= p8) AND (1 <= p9))))) U (1 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((F (((1 <= p8) AND (1 <= p9))) OR (1 <= p18)) U G (((1 <= p8) AND (1 <= p9))))) U (1 <= p18))
lola: processed formula length: 98
lola: 46 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: 4931452 markings, 7435089 edges, 986290 markings/sec, 0 secs
lola: 9665628 markings, 14557885 edges, 946835 markings/sec, 5 secs
lola: 14343321 markings, 21592365 edges, 935539 markings/sec, 10 secs
lola: 18902781 markings, 28447164 edges, 911892 markings/sec, 15 secs
lola: 23450452 markings, 35283246 edges, 909534 markings/sec, 20 secs
lola: 27978736 markings, 42089146 edges, 905657 markings/sec, 25 secs
lola: 32479924 markings, 48853454 edges, 900238 markings/sec, 30 secs
lola: 36904941 markings, 55502818 edges, 885003 markings/sec, 35 secs
lola: 41387785 markings, 62238601 edges, 896569 markings/sec, 40 secs
lola: 45767676 markings, 68819444 edges, 875978 markings/sec, 45 secs
lola: 50053260 markings, 75258018 edges, 857117 markings/sec, 50 secs
lola: 54272271 markings, 81596651 edges, 843802 markings/sec, 55 secs
lola: 58582556 markings, 88071781 edges, 862057 markings/sec, 60 secs
lola: 62900704 markings, 94558537 edges, 863630 markings/sec, 65 secs
lola: 67193715 markings, 101007452 edges, 858602 markings/sec, 70 secs
lola: 71461712 markings, 107418462 edges, 853599 markings/sec, 75 secs
lola: 75140277 markings, 112945372 edges, 735713 markings/sec, 80 secs
lola: 78656152 markings, 118226946 edges, 703175 markings/sec, 85 secs
lola: 82159703 markings, 123488749 edges, 700710 markings/sec, 90 secs
lola: 85656480 markings, 128739903 edges, 699355 markings/sec, 95 secs
lola: 89180375 markings, 134032813 edges, 704779 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F ((X (G (((p8 <= 0) OR (p25 <= 0)))) OR F ((X (((p13 <= 0))) AND G (((1 <= p8) AND (1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((p8 <= 0) OR (p25 <= 0)))) OR F ((X (((p13 <= 0))) AND G (((1 <= p8) AND (1 <= p25)))))))
lola: processed formula length: 101
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4862877 markings, 7331879 edges, 972575 markings/sec, 0 secs
lola: 9550475 markings, 14384654 edges, 937520 markings/sec, 5 secs
lola: 14156571 markings, 21311543 edges, 921219 markings/sec, 10 secs
lola: 18684022 markings, 28118342 edges, 905490 markings/sec, 15 secs
lola: 23176897 markings, 34872105 edges, 898575 markings/sec, 20 secs
lola: 27549374 markings, 41443706 edges, 874495 markings/sec, 25 secs
lola: 31955532 markings, 48065490 edges, 881232 markings/sec, 30 secs
lola: 36272441 markings, 54552333 edges, 863382 markings/sec, 35 secs
lola: 40643801 markings, 61120905 edges, 874272 markings/sec, 40 secs
lola: 44823386 markings, 67400822 edges, 835917 markings/sec, 45 secs
lola: 49180868 markings, 73947582 edges, 871496 markings/sec, 50 secs
lola: 53541312 markings, 80498463 edges, 872089 markings/sec, 55 secs
lola: 57721773 markings, 86778826 edges, 836092 markings/sec, 60 secs
lola: 61862416 markings, 92998906 edges, 828129 markings/sec, 65 secs
lola: 65980426 markings, 99184947 edges, 823602 markings/sec, 70 secs
lola: 70027477 markings, 105264130 edges, 809410 markings/sec, 75 secs
lola: 73940204 markings, 111143163 edges, 782545 markings/sec, 80 secs
lola: 77595897 markings, 116634166 edges, 731139 markings/sec, 85 secs
lola: 81277772 markings, 122164282 edges, 736375 markings/sec, 90 secs
lola: 85025703 markings, 127809063 edges, 749586 markings/sec, 95 secs
lola: 88862723 markings, 133555303 edges, 767404 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (((((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0)) U G (((p3 <= 0) OR (p4 <= 0) OR (p24 <= 0)))) AND G (((p3 <= 0) OR (p4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((p5 <= 0) OR (p7 <= 0) OR (p26 <= 0)) U G (((p3 <= 0) OR (p4 <= 0) OR (p24 <= 0)))) AND G (((p3 <= 0) OR (p4 <= 0)))))
lola: processed formula length: 129
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 2978767 markings, 7685424 edges, 595753 markings/sec, 0 secs
lola: 5434163 markings, 15116577 edges, 491079 markings/sec, 5 secs
lola: 7879227 markings, 22517750 edges, 489013 markings/sec, 10 secs
lola: 10303027 markings, 29857676 edges, 484760 markings/sec, 15 secs
lola: 12722983 markings, 37186074 edges, 483991 markings/sec, 20 secs
lola: 15112011 markings, 44415880 edges, 477806 markings/sec, 25 secs
lola: 17490721 markings, 51620848 edges, 475742 markings/sec, 30 secs
lola: 19853078 markings, 58773029 edges, 472471 markings/sec, 35 secs
lola: 22179448 markings, 65816456 edges, 465274 markings/sec, 40 secs
lola: 24497497 markings, 72831934 edges, 463610 markings/sec, 45 secs
lola: 26775931 markings, 79730874 edges, 455687 markings/sec, 50 secs
lola: 29046359 markings, 86607184 edges, 454086 markings/sec, 55 secs
lola: 31332963 markings, 93531045 edges, 457321 markings/sec, 60 secs
lola: 33613865 markings, 100437700 edges, 456180 markings/sec, 65 secs
lola: 35865750 markings, 107251993 edges, 450377 markings/sec, 70 secs
lola: 38056358 markings, 113887680 edges, 438122 markings/sec, 75 secs
lola: 40335534 markings, 120788160 edges, 455835 markings/sec, 80 secs
lola: 42636457 markings, 127754570 edges, 460185 markings/sec, 85 secs
lola: 44899217 markings, 134600347 edges, 452552 markings/sec, 90 secs
lola: 47306491 markings, 141563622 edges, 481455 markings/sec, 95 secs
lola: 50527032 markings, 149133915 edges, 644108 markings/sec, 100 secs
lola: 53596929 markings, 156356913 edges, 613979 markings/sec, 105 secs
lola: 56602944 markings, 163426747 edges, 601203 markings/sec, 110 secs
lola: 59555018 markings, 170369823 edges, 590415 markings/sec, 115 secs
lola: 62474170 markings, 177236609 edges, 583830 markings/sec, 120 secs
lola: 65391979 markings, 184097810 edges, 583562 markings/sec, 125 secs
lola: 68259254 markings, 190841766 edges, 573455 markings/sec, 130 secs
lola: 72197147 markings, 199385611 edges, 787579 markings/sec, 135 secs
lola: 76287047 markings, 208123431 edges, 817980 markings/sec, 140 secs
lola: 80336295 markings, 216788263 edges, 809850 markings/sec, 145 secs
lola: 84465396 markings, 225766501 edges, 825820 markings/sec, 150 secs
lola: 88628314 markings, 234661077 edges, 832584 markings/sec, 155 secs
lola: 92689793 markings, 243339552 edges, 812296 markings/sec, 160 secs
lola: 96786048 markings, 252092374 edges, 819251 markings/sec, 165 secs
lola: 100550525 markings, 260139606 edges, 752895 markings/sec, 170 secs
lola: 103845498 markings, 267177942 edges, 658995 markings/sec, 175 secs
lola: 107419533 markings, 274812644 edges, 714807 markings/sec, 180 secs
lola: 110857169 markings, 282158574 edges, 687527 markings/sec, 185 secs
lola: 114438799 markings, 289810930 edges, 716326 markings/sec, 190 secs
lola: 117973382 markings, 297363776 edges, 706917 markings/sec, 195 secs
lola: 121559971 markings, 305026775 edges, 717318 markings/sec, 200 secs
lola: 123266571 markings, 308673428 edges, 341320 markings/sec, 205 secs
lola: 125051250 markings, 312487050 edges, 356936 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (((p8 <= 0) OR (p9 <= 0))) OR ((p24 <= 0) AND (1 <= p8) AND (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p24 <= 0) AND (1 <= p8) AND (1 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p24 <= 0) AND (1 <= p8) AND (1 <= p9))
lola: processed formula length: 40
lola: 46 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((p8 <= 0) OR (p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p8 <= 0) OR (p9 <= 0)))
lola: processed formula length: 29
lola: 46 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: 3845 markings, 3845 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown yes no no unknown no no no no no no no yes unknown no
lola:
preliminary result: unknown yes no no unknown no no no no no no no yes unknown no
lola: memory consumption: 3676 KB
lola: time consumption: 876 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-01280by00640"
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-01280by00640, 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-162038334800218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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