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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K 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 101K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-309-00
FORMULA_NAME CloudReconfiguration-PT-309-01
FORMULA_NAME CloudReconfiguration-PT-309-02
FORMULA_NAME CloudReconfiguration-PT-309-03
FORMULA_NAME CloudReconfiguration-PT-309-04
FORMULA_NAME CloudReconfiguration-PT-309-05
FORMULA_NAME CloudReconfiguration-PT-309-06
FORMULA_NAME CloudReconfiguration-PT-309-07
FORMULA_NAME CloudReconfiguration-PT-309-08
FORMULA_NAME CloudReconfiguration-PT-309-09
FORMULA_NAME CloudReconfiguration-PT-309-10
FORMULA_NAME CloudReconfiguration-PT-309-11
FORMULA_NAME CloudReconfiguration-PT-309-12
FORMULA_NAME CloudReconfiguration-PT-309-13
FORMULA_NAME CloudReconfiguration-PT-309-14
FORMULA_NAME CloudReconfiguration-PT-309-15

=== Now, execution of the tool begins

BK_START 1620904647821

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 11:17:29] [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:17:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:17:30] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2021-05-13 11:17:30] [INFO ] Transformed 2585 places.
[2021-05-13 11:17:30] [INFO ] Transformed 3095 transitions.
[2021-05-13 11:17:30] [INFO ] Found NUPN structural information;
[2021-05-13 11:17:30] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 94 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 719 resets, run finished after 337 ms. (steps per millisecond=296 ) properties seen :[0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1]
// Phase 1: matrix 3095 rows 2585 cols
[2021-05-13 11:17:30] [INFO ] Computed 4 place invariants in 51 ms
[2021-05-13 11:17:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2021-05-13 11:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:17:45] [INFO ] [Real]Absence check using state equation in 14102 ms returned sat
[2021-05-13 11:17:45] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 191 ms.
[2021-05-13 11:17:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:18:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:18:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19325 ms returned (error "Failed to check-sat")
[2021-05-13 11:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:18:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 0
[2021-05-13 11:18:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 62 ms returned sat
[2021-05-13 11:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:18:23] [INFO ] [Real]Absence check using state equation in 16152 ms returned sat
[2021-05-13 11:18:23] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 179 ms.
[2021-05-13 11:18:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:18:44] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:18:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19754 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 11:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:18:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2021-05-13 11:18:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 85 ms returned sat
[2021-05-13 11:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:18:58] [INFO ] [Real]Absence check using state equation in 12845 ms returned sat
[2021-05-13 11:18:58] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 150 ms.
[2021-05-13 11:18:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:19:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19791 ms returned (error "Failed to check-sat")
[2021-05-13 11:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2021-05-13 11:19:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2021-05-13 11:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:34] [INFO ] [Real]Absence check using state equation in 14148 ms returned sat
[2021-05-13 11:19:34] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 177 ms.
[2021-05-13 11:19:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:19:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19818 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 11:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 3
[2021-05-13 11:19:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 90 ms returned sat
[2021-05-13 11:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:20:15] [INFO ] [Real]Absence check using state equation in 19324 ms returned unknown
[2021-05-13 11:20:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-13 11:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:32] [INFO ] [Real]Absence check using state equation in 16483 ms returned sat
[2021-05-13 11:20:32] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 135 ms.
[2021-05-13 11:20:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:20:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:20:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19728 ms returned unknown
[2021-05-13 11:20:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2021-05-13 11:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:21:10] [INFO ] [Real]Absence check using state equation in 15975 ms returned sat
[2021-05-13 11:21:10] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 150 ms.
[2021-05-13 11:21:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:21:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:21:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19666 ms returned unknown
[2021-05-13 11:21:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2021-05-13 11:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:21:45] [INFO ] [Real]Absence check using state equation in 13563 ms returned sat
[2021-05-13 11:21:45] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 118 ms.
[2021-05-13 11:21:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:22:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:22:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19795 ms returned unknown
[2021-05-13 11:22:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-13 11:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:22:24] [INFO ] [Real]Absence check using state equation in 17753 ms returned sat
[2021-05-13 11:22:24] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 280 ms.
[2021-05-13 11:22:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:22:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:22:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19457 ms returned unknown
[2021-05-13 11:22:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2021-05-13 11:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:22:58] [INFO ] [Real]Absence check using state equation in 12058 ms returned sat
[2021-05-13 11:22:58] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 134 ms.
[2021-05-13 11:22:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:23:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:23:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19704 ms returned unknown
[2021-05-13 11:23:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 11:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:23:34] [INFO ] [Real]Absence check using state equation in 13954 ms returned sat
[2021-05-13 11:23:34] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 122 ms.
[2021-05-13 11:23:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:23:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:23:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19720 ms returned unknown
[2021-05-13 11:23:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 81 ms returned sat
[2021-05-13 11:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:24:11] [INFO ] [Real]Absence check using state equation in 15460 ms returned sat
[2021-05-13 11:24:11] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 125 ms.
[2021-05-13 11:24:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:24:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:24:32] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19731 ms returned unknown
[2021-05-13 11:24:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2021-05-13 11:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:24:47] [INFO ] [Real]Absence check using state equation in 14268 ms returned sat
[2021-05-13 11:24:47] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 129 ms.
[2021-05-13 11:24:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:25:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:25:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19760 ms returned unknown
[2021-05-13 11:25:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2021-05-13 11:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:25:21] [INFO ] [Real]Absence check using state equation in 12688 ms returned sat
[2021-05-13 11:25:21] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 126 ms.
[2021-05-13 11:25:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:25:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:25:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19721 ms returned unknown
[2021-05-13 11:25:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2021-05-13 11:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:26:02] [INFO ] [Real]Absence check using state equation in 19524 ms returned sat
[2021-05-13 11:26:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:26:22] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:26:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19751 ms returned unknown
[2021-05-13 11:26:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2021-05-13 11:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:26:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:26:42] [INFO ] [Real]Absence check using state equation in 19731 ms returned (error "Failed to check-sat")
[2021-05-13 11:26:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 107 ms returned sat
[2021-05-13 11:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:27:02] [INFO ] [Real]Absence check using state equation in 19322 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 11:27:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 78 ms returned sat
[2021-05-13 11:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:27:10] [INFO ] [Real]Absence check using state equation in 6657 ms returned unsat
[2021-05-13 11:27:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 99 ms returned sat
[2021-05-13 11:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:27:30] [INFO ] [Real]Absence check using state equation in 19314 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 11:27:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 59 ms returned sat
[2021-05-13 11:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:27:50] [INFO ] [Real]Absence check using state equation in 19392 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 11:27:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 106 ms returned sat
[2021-05-13 11:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:28:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:28:10] [INFO ] [Real]Absence check using state equation in 19351 ms returned (error "Failed to check-sat")
[2021-05-13 11:28:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 94 ms returned sat
[2021-05-13 11:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:28:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s2069 (- t572 t573))") while checking expression at index 21
[2021-05-13 11:28:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2021-05-13 11:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:28:49] [INFO ] [Real]Absence check using state equation in 18477 ms returned sat
[2021-05-13 11:28:49] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 191 ms.
[2021-05-13 11:28:50] [INFO ] Added : 15 causal constraints over 3 iterations in 673 ms. Result :(error "Failed to check-sat")
[2021-05-13 11:28:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 61 ms returned sat
[2021-05-13 11:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:29:07] [INFO ] [Real]Absence check using state equation in 16029 ms returned sat
[2021-05-13 11:29:07] [INFO ] Computed and/alt/rep : 3094/4086/3094 causal constraints in 277 ms.
[2021-05-13 11:29:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:29:28] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 11:29:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19759 ms returned unknown
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 11:29:29] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 11:29:29] [INFO ] Flatten gal took : 287 ms
FORMULA CloudReconfiguration-PT-309-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-309-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-309-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-309-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:29:29] [INFO ] Applying decomposition
[2021-05-13 11:29:29] [INFO ] Flatten gal took : 103 ms
[2021-05-13 11:29:29] [INFO ] Decomposing Gal with order
[2021-05-13 11:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:29:29] [INFO ] Removed a total of 123 redundant transitions.
[2021-05-13 11:29:29] [INFO ] Flatten gal took : 204 ms
[2021-05-13 11:29:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 11 ms.
[2021-05-13 11:29:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 11:29:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudReconfiguration-PT-309 @ 3570 seconds

FORMULA CloudReconfiguration-PT-309-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-309-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3418
rslt: Output for LTLFireability @ CloudReconfiguration-PT-309

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 293
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((F ((G (((1 <= p1372))) AND ((p2270 <= 0)))) AND (F (((1 <= p2270))) OR X (F ((G (((1 <= p1372))) AND ((p2270 <= 0)))))))))",
"processed_size": 129,
"rewrites": 70
},
"result":
{
"edges": 78,
"markings": 78,
"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": 320
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p2337 <= 0))",
"processed_size": 14,
"rewrites": 72
},
"result":
{
"edges": 89,
"markings": 89,
"produced_by": "state space / EG",
"value": false
},
"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": 391
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p2416)))",
"processed_size": 18,
"rewrites": 70
},
"result":
{
"edges": 89,
"markings": 89,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"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": "X ((X (F (((p1268 <= 0)))) R ((p1543 <= 0) OR (p456 <= 0))))",
"processed_size": 61,
"rewrites": 70
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"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": 391
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 5,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X (X (G ((X (((1 <= p1761))) AND (((1 <= p1985)) OR ((1 <= p1080)))))))))",
"processed_size": 80,
"rewrites": 70
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 440
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"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": "X (G ((X (X (F (((p2106 <= 0))))) AND ((p1689 <= 0)))))",
"processed_size": 55,
"rewrites": 70
},
"result":
{
"edges": 7654270,
"markings": 2037679,
"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": 488
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 570
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 2,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((F (((1 <= p1434))) U (F (((1 <= p1216))) OR (F (((1 <= p1434))) AND ((1 <= p77))))) U ((1 <= p2060))))",
"processed_size": 107,
"rewrites": 70
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 684
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p1557 <= 0))))",
"processed_size": 22,
"rewrites": 70
},
"result":
{
"edges": 77508,
"markings": 57754,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 855
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p523 <= 0))))",
"processed_size": 21,
"rewrites": 70
},
"result":
{
"edges": 8567,
"markings": 4105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1140
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p1439 <= 0))))",
"processed_size": 22,
"rewrites": 70
},
"result":
{
"edges": 122523,
"markings": 93784,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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 <= p572)) OR ((1 <= p1612)))))",
"processed_size": 42,
"rewrites": 70
},
"result":
{
"edges": 88,
"markings": 88,
"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": 3418
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p505 <= 0)) U ((((1 <= p1233)) U ((1 <= p505))) OR (F ((((1 <= p2002)) OR ((1 <= p2280)))) OR ((1 <= p348)))))",
"processed_size": 114,
"rewrites": 70
},
"result":
{
"edges": 89,
"markings": 89,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 101428,
"runtime": 152.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : X(G((F((G(*) AND *)) AND (F(**) OR X(F((G(*) AND *))))))) : (G(**) OR (** OR (X((** U **)) AND F(**)))) : X((X(F(*)) R *)) : X(X(X(X(G((X(**) AND **)))))) : (** U ((** U **) OR (F(**) OR **))) : X(G((X(X(F(*))) AND *))) : (X(F(**)) OR **) : F(G(*)) : X(((F(**) U (F(**) OR (F(**) AND **))) U **)) : F(G(**)) : G(F(**))"
},
"net":
{
"arcs": 6463,
"conflict_clusters": 2448,
"places": 2585,
"places_significant": 2581,
"singleton_clusters": 0,
"transitions": 3095
},
"result":
{
"preliminary_value": "no no no yes no no no no no no no no ",
"value": "no no no yes 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: 5680/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2585
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 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: (p746 <= 1)
lola: LP says that atomic proposition is always true: (p2183 <= 1)
lola: LP says that atomic proposition is always true: (p523 <= 1)
lola: LP says that atomic proposition is always true: (p2270 <= 1)
lola: LP says that atomic proposition is always true: (p1372 <= 1)
lola: LP says that atomic proposition is always true: (p1372 <= 1)
lola: LP says that atomic proposition is always true: (p2270 <= 1)
lola: LP says that atomic proposition is always true: (p2416 <= 1)
lola: LP says that atomic proposition is always true: (p2376 <= 1)
lola: LP says that atomic proposition is always true: (p2337 <= 1)
lola: LP says that atomic proposition is always true: (p2416 <= 1)
lola: LP says that atomic proposition is always true: (p2337 <= 1)
lola: LP says that atomic proposition is always true: (p1268 <= 1)
lola: LP says that atomic proposition is always true: (p1543 <= 1)
lola: LP says that atomic proposition is always true: (p456 <= 1)
lola: LP says that atomic proposition is always true: (p1761 <= 1)
lola: LP says that atomic proposition is always true: (p1985 <= 1)
lola: LP says that atomic proposition is always true: (p1080 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p1233 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p2002 <= 1)
lola: LP says that atomic proposition is always true: (p2280 <= 1)
lola: LP says that atomic proposition is always true: (p348 <= 1)
lola: LP says that atomic proposition is always true: (p2106 <= 1)
lola: LP says that atomic proposition is always true: (p1689 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1318 <= 1)
lola: LP says that atomic proposition is always true: (p1557 <= 1)
lola: LP says that atomic proposition is always true: (p1557 <= 1)
lola: LP says that atomic proposition is always true: (p1557 <= 1)
lola: LP says that atomic proposition is always true: (p1434 <= 1)
lola: LP says that atomic proposition is always true: (p1216 <= 1)
lola: LP says that atomic proposition is always true: (p1434 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p2060 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p431 <= 1)
lola: LP says that atomic proposition is always true: (p1439 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1612 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1612 <= 1)
lola: G (F (NOT(F (X ((X (((1 <= p2183) AND ((p746 <= 0)))) U X (((1 <= p523))))))))) : G (X ((F (((1 <= p2270))) U NOT(X (G (((((1 <= p1372)) U ((p1372 <= 0))) OR ((1 <= p2270))))))))) : ((G (((1 <= p2416))) OR ((1 <= p2376))) OR ((X (((1 <= p2337))) U X (((1 <= p2416)))) AND F (((1 <= p2337))))) : X (NOT((X (G (((1 <= p1268)))) U ((1 <= p1543) AND (1 <= p456))))) : X (X (X (G (X ((X (((1 <= p1761))) AND (((1 <= p1985)) OR ((1 <= p1080))))))))) : (((p505 <= 0)) U (((((1 <= p1233)) U ((1 <= p505))) OR F ((((1 <= p2002)) OR ((1 <= p2280))))) OR ((1 <= p348)))) : X (NOT(F ((X (X (G (((1 <= p2106))))) OR ((1 <= p1689)))))) : (F (X (((1 <= p388)))) OR ((1 <= p11))) : (NOT((((1 <= p572) AND (1 <= p1318)) U X (((1 <= p1557))))) U F (NOT(F ((X (((p1557 <= 0))) U X (((1 <= p1557)))))))) : X (((F (((1 <= p1434))) U (F (((1 <= p1216))) OR (F (((1 <= p1434))) AND ((1 <= p77))))) U ((1 <= p2060)))) : X (((NOT(X (G (((1 <= p431))))) OR ((1 <= p431))) U F (G (X (((p1439 <= 0))))))) : G (F (((((1 <= p572)) U ((1 <= p1612))) U X ((((1 <= p572)) OR ((1 <= p1612)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((G (((1 <= p1372))) AND ((p2270 <= 0)))) AND (F (((1 <= p2270))) OR X (F ((G (((1 <= p1372))) AND ((p2270 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((G (((1 <= p1372))) AND ((p2270 <= 0)))) AND (F (((1 <= p2270))) OR X (F ((G (((1 <= p1372))) AND ((p2270 <= 0)))))))))
lola: processed formula length: 129
lola: 70 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: 78 markings, 78 edges
lola: ========================================
lola: subprocess 1 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p2416))) OR (((1 <= p2376)) OR (X ((((1 <= p2337)) U ((1 <= p2416)))) AND F (((1 <= p2337))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2376))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2376))
lola: processed formula length: 14
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2337)))
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: ((p2337 <= 0))
lola: processed formula length: 14
lola: 72 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: 89 markings, 89 edges
lola: ========================================
lola: subprocess 3 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p2416)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p2416)))
lola: processed formula length: 18
lola: 70 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: 89 markings, 89 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 2 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((p1268 <= 0)))) R ((p1543 <= 0) OR (p456 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((p1268 <= 0)))) R ((p1543 <= 0) OR (p456 <= 0))))
lola: processed formula length: 61
lola: 70 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: ========================================
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G ((X (((1 <= p1761))) AND (((1 <= p1985)) OR ((1 <= p1080)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G ((X (((1 <= p1761))) AND (((1 <= p1985)) OR ((1 <= p1080)))))))))
lola: processed formula length: 80
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 73 edges
lola: ========================================
lola: subprocess 4 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (X (F (((p2106 <= 0))))) AND ((p1689 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X (F (((p2106 <= 0))))) AND ((p1689 <= 0)))))
lola: processed formula length: 55
lola: 70 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: 125007 markings, 384012 edges, 25001 markings/sec, 0 secs
lola: 231810 markings, 764053 edges, 21361 markings/sec, 5 secs
lola: 356517 markings, 1135528 edges, 24941 markings/sec, 10 secs
lola: 468441 markings, 1513824 edges, 22385 markings/sec, 15 secs
lola: 581328 markings, 1888458 edges, 22577 markings/sec, 20 secs
lola: 708672 markings, 2262181 edges, 25469 markings/sec, 25 secs
lola: 821006 markings, 2638219 edges, 22467 markings/sec, 30 secs
lola: 932435 markings, 3018415 edges, 22286 markings/sec, 35 secs
lola: 1036950 markings, 3394030 edges, 20903 markings/sec, 40 secs
lola: 1129013 markings, 3777124 edges, 18413 markings/sec, 45 secs
lola: 1211513 markings, 4155865 edges, 16500 markings/sec, 50 secs
lola: 1304896 markings, 4529343 edges, 18677 markings/sec, 55 secs
lola: 1393758 markings, 4900153 edges, 17772 markings/sec, 60 secs
lola: 1481185 markings, 5282278 edges, 17485 markings/sec, 65 secs
lola: 1569507 markings, 5657056 edges, 17664 markings/sec, 70 secs
lola: 1655715 markings, 6029779 edges, 17242 markings/sec, 75 secs
lola: 1755983 markings, 6411482 edges, 20054 markings/sec, 80 secs
lola: 1838428 markings, 6780505 edges, 16489 markings/sec, 85 secs
lola: 1926268 markings, 7163191 edges, 17568 markings/sec, 90 secs
lola: 2005884 markings, 7535369 edges, 15923 markings/sec, 95 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2037679 markings, 7654270 edges
lola: ========================================
lola: subprocess 5 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p388)))) OR ((1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p11))
lola: processed formula length: 12
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p388))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p388))))
lola: processed formula length: 21
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 73 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F (((1 <= p1434))) U (F (((1 <= p1216))) OR (F (((1 <= p1434))) AND ((1 <= p77))))) U ((1 <= p2060))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F (((1 <= p1434))) U (F (((1 <= p1216))) OR (F (((1 <= p1434))) AND ((1 <= p77))))) U ((1 <= p2060))))
lola: processed formula length: 107
lola: 70 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: 73 markings, 73 edges
lola: ========================================
lola: subprocess 7 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p1557 <= 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 (((p1557 <= 0))))
lola: processed formula length: 22
lola: 70 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 1006
lola: add low 928
lola: add low 929
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: 57754 markings, 77508 edges
lola: ========================================
lola: subprocess 8 will run for 855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p523 <= 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 (((p523 <= 0))))
lola: processed formula length: 21
lola: 70 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 655
lola: add low 656
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: 4105 markings, 8567 edges
lola: ========================================
lola: subprocess 9 will run for 1140 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p1439 <= 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 (((p1439 <= 0))))
lola: processed formula length: 22
lola: 70 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 1213
lola: add low 1214
lola: add low 1311
lola: add low 1312
lola: add low 1094
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: 93784 markings, 122523 edges
lola: ========================================
lola: subprocess 10 will run for 1709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p572)) OR ((1 <= p1612)))))
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 <= p572)) OR ((1 <= p1612)))))
lola: processed formula length: 42
lola: 70 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: 88 markings, 88 edges
lola: ========================================
lola: subprocess 11 will run for 3418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p505 <= 0)) U ((((1 <= p1233)) U ((1 <= p505))) OR (F ((((1 <= p2002)) OR ((1 <= p2280)))) OR ((1 <= p348)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p505 <= 0)) U ((((1 <= p1233)) U ((1 <= p505))) OR (F ((((1 <= p2002)) OR ((1 <= p2280)))) OR ((1 <= p348)))))
lola: processed formula length: 114
lola: 70 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: 89 markings, 89 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no no no no
lola:
preliminary result: no no no yes no no no no no no no no
lola: memory consumption: 101428 KB
lola: time consumption: 152 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="CloudReconfiguration-PT-309"
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 CloudReconfiguration-PT-309, 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-162038334800270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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