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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.5K Mar 28 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:52 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 661K 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-318-00
FORMULA_NAME CloudReconfiguration-PT-318-01
FORMULA_NAME CloudReconfiguration-PT-318-02
FORMULA_NAME CloudReconfiguration-PT-318-03
FORMULA_NAME CloudReconfiguration-PT-318-04
FORMULA_NAME CloudReconfiguration-PT-318-05
FORMULA_NAME CloudReconfiguration-PT-318-06
FORMULA_NAME CloudReconfiguration-PT-318-07
FORMULA_NAME CloudReconfiguration-PT-318-08
FORMULA_NAME CloudReconfiguration-PT-318-09
FORMULA_NAME CloudReconfiguration-PT-318-10
FORMULA_NAME CloudReconfiguration-PT-318-11
FORMULA_NAME CloudReconfiguration-PT-318-12
FORMULA_NAME CloudReconfiguration-PT-318-13
FORMULA_NAME CloudReconfiguration-PT-318-14
FORMULA_NAME CloudReconfiguration-PT-318-15

=== Now, execution of the tool begins

BK_START 1620908027336

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 12:13:49] [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 12:13:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 12:13:49] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2021-05-13 12:13:49] [INFO ] Transformed 2587 places.
[2021-05-13 12:13:49] [INFO ] Transformed 3099 transitions.
[2021-05-13 12:13:49] [INFO ] Found NUPN structural information;
[2021-05-13 12:13:49] [INFO ] Parsed PT model containing 2587 places and 3099 transitions in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 121 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 810 resets, run finished after 400 ms. (steps per millisecond=250 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
// Phase 1: matrix 3099 rows 2587 cols
[2021-05-13 12:13:50] [INFO ] Computed 4 place invariants in 96 ms
[2021-05-13 12:13:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 59 ms returned sat
[2021-05-13 12:13:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:14:03] [INFO ] [Real]Absence check using state equation in 12051 ms returned sat
[2021-05-13 12:14:03] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 235 ms.
[2021-05-13 12:14:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:14:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:14:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19806 ms returned (error "Failed to check-sat")
[2021-05-13 12:14:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:14:24] [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 12:14:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:14:36] [INFO ] [Real]Absence check using state equation in 12016 ms returned sat
[2021-05-13 12:14:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:14:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:14:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19833 ms returned (error "Failed to check-sat")
[2021-05-13 12:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:14:56] [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 12:14:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:09] [INFO ] [Real]Absence check using state equation in 12036 ms returned sat
[2021-05-13 12:15:09] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 118 ms.
[2021-05-13 12:15:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:15:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:15:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19766 ms returned (error "Failed to check-sat")
[2021-05-13 12:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:30] [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 2
[2021-05-13 12:15:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 12:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:42] [INFO ] [Real]Absence check using state equation in 11578 ms returned sat
[2021-05-13 12:15:42] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 101 ms.
[2021-05-13 12:15:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:16:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:16:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19754 ms returned unknown
[2021-05-13 12:16:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-13 12:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:14] [INFO ] [Real]Absence check using state equation in 11204 ms returned sat
[2021-05-13 12:16:14] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 122 ms.
[2021-05-13 12:16:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:16:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:16:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19785 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 12:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:36] [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 4
[2021-05-13 12:16:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:47] [INFO ] [Real]Absence check using state equation in 11243 ms returned sat
[2021-05-13 12:16:47] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 127 ms.
[2021-05-13 12:16:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:17:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:17:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19796 ms returned (error "Failed to check-sat")
[2021-05-13 12:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:17:08] [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 5
[2021-05-13 12:17:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:17:10] [INFO ] [Real]Absence check using state equation in 1809 ms returned unsat
[2021-05-13 12:17:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:17:23] [INFO ] [Real]Absence check using state equation in 11949 ms returned sat
[2021-05-13 12:17:23] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 105 ms.
[2021-05-13 12:17:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:17:44] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:17:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19803 ms returned unknown
[2021-05-13 12:17:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-13 12:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:17:56] [INFO ] [Real]Absence check using state equation in 11766 ms returned sat
[2021-05-13 12:17:56] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 102 ms.
[2021-05-13 12:17:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:18:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19809 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 12:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:18:17] [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 8
[2021-05-13 12:18:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-13 12:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:18:29] [INFO ] [Real]Absence check using state equation in 12142 ms returned sat
[2021-05-13 12:18:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:18:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:18:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19795 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 12:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:18:49] [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 9
[2021-05-13 12:18:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:19:03] [INFO ] [Real]Absence check using state equation in 13449 ms returned sat
[2021-05-13 12:19:03] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 137 ms.
[2021-05-13 12:19:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:19:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:19:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19743 ms returned unknown
[2021-05-13 12:19:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 12:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:19:35] [INFO ] [Real]Absence check using state equation in 11029 ms returned sat
[2021-05-13 12:19:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:19:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:19:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19809 ms returned unknown
[2021-05-13 12:19:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-13 12:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:20:09] [INFO ] [Real]Absence check using state equation in 13052 ms returned sat
[2021-05-13 12:20:09] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 100 ms.
[2021-05-13 12:20:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:20:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:20:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19716 ms returned unknown
[2021-05-13 12:20:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:20:41] [INFO ] [Real]Absence check using state equation in 11301 ms returned sat
[2021-05-13 12:20:41] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 113 ms.
[2021-05-13 12:20:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:21:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:21:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19796 ms returned unknown
[2021-05-13 12:21:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:21:13] [INFO ] [Real]Absence check using state equation in 11129 ms returned sat
[2021-05-13 12:21:14] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 95 ms.
[2021-05-13 12:21:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:21:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:21:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19782 ms returned unknown
[2021-05-13 12:21:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 12:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:21:46] [INFO ] [Real]Absence check using state equation in 10958 ms returned sat
[2021-05-13 12:21:46] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 104 ms.
[2021-05-13 12:21:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:22:07] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:22:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19653 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 12:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:22:07] [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 15
[2021-05-13 12:22:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:22:18] [INFO ] [Real]Absence check using state equation in 11338 ms returned sat
[2021-05-13 12:22:19] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 101 ms.
[2021-05-13 12:22:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:22:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:22:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19652 ms returned unknown
[2021-05-13 12:22:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 58 ms returned sat
[2021-05-13 12:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:22:52] [INFO ] [Real]Absence check using state equation in 11996 ms returned sat
[2021-05-13 12:22:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:23:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:23:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19803 ms returned (error "Failed to check-sat")
[2021-05-13 12:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:23:12] [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 17
[2021-05-13 12:23:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 12:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:23:23] [INFO ] [Real]Absence check using state equation in 10941 ms returned sat
[2021-05-13 12:23:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:23:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:23:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19784 ms returned unknown
[2021-05-13 12:23:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 12:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:23:55] [INFO ] [Real]Absence check using state equation in 11545 ms returned sat
[2021-05-13 12:23:55] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 102 ms.
[2021-05-13 12:23:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:24:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:24:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19801 ms returned unknown
[2021-05-13 12:24:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 52 ms returned sat
[2021-05-13 12:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:24:28] [INFO ] [Real]Absence check using state equation in 11605 ms returned sat
[2021-05-13 12:24:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:24:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:24:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19796 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 12:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:24:48] [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 20
[2021-05-13 12:24:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 81 ms returned sat
[2021-05-13 12:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:24:59] [INFO ] [Real]Absence check using state equation in 11229 ms returned sat
[2021-05-13 12:24:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:25:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:25:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19798 ms returned unknown
[2021-05-13 12:25:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:25:31] [INFO ] [Real]Absence check using state equation in 11614 ms returned sat
[2021-05-13 12:25:32] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 103 ms.
[2021-05-13 12:25:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:25:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:25:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19810 ms returned unknown
[2021-05-13 12:25:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 12:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:26:04] [INFO ] [Real]Absence check using state equation in 11425 ms returned sat
[2021-05-13 12:26:04] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 120 ms.
[2021-05-13 12:26:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:26:25] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:26:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19787 ms returned unknown
[2021-05-13 12:26:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 57 ms returned sat
[2021-05-13 12:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:26:37] [INFO ] [Real]Absence check using state equation in 11890 ms returned sat
[2021-05-13 12:26:37] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 157 ms.
[2021-05-13 12:26:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:26:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:26:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19713 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 12:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:26:58] [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 24
[2021-05-13 12:26:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-13 12:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:27:09] [INFO ] [Real]Absence check using state equation in 10922 ms returned sat
[2021-05-13 12:27:10] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 130 ms.
[2021-05-13 12:27:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:27:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:27:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19815 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 12:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 12:27:30] [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 25
[2021-05-13 12:27:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2021-05-13 12:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:27:44] [INFO ] [Real]Absence check using state equation in 13592 ms returned sat
[2021-05-13 12:27:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:28:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:28:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19659 ms returned unknown
[2021-05-13 12:28:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 72 ms returned sat
[2021-05-13 12:28:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:28:18] [INFO ] [Real]Absence check using state equation in 12979 ms returned sat
[2021-05-13 12:28:18] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 138 ms.
[2021-05-13 12:28:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:28:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:28:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19757 ms returned unknown
[2021-05-13 12:28:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 80 ms returned sat
[2021-05-13 12:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:28:57] [INFO ] [Real]Absence check using state equation in 17812 ms returned sat
[2021-05-13 12:28:58] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 122 ms.
[2021-05-13 12:28:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:29:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:29:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19728 ms returned unknown
[2021-05-13 12:29:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2021-05-13 12:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:29:34] [INFO ] [Real]Absence check using state equation in 15323 ms returned sat
[2021-05-13 12:29:34] [INFO ] Computed and/alt/rep : 3098/4122/3098 causal constraints in 135 ms.
[2021-05-13 12:29:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 12:29:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 12:29:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 19745 ms returned unknown
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 12:29:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 12:29:56] [INFO ] Flatten gal took : 341 ms
FORMULA CloudReconfiguration-PT-318-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-318-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 12:29:56] [INFO ] Applying decomposition
[2021-05-13 12:29:56] [INFO ] Flatten gal took : 152 ms
[2021-05-13 12:29:56] [INFO ] Decomposing Gal with order
[2021-05-13 12:29:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 12:29:57] [INFO ] Removed a total of 129 redundant transitions.
[2021-05-13 12:29:57] [INFO ] Flatten gal took : 227 ms
[2021-05-13 12:29:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 342 labels/synchronizations in 17 ms.
[2021-05-13 12:29:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2021-05-13 12:29:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 43 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudReconfiguration-PT-318 @ 3570 seconds

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

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

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

FORMULA CloudReconfiguration-PT-318-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-318-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-318-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-318-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA CloudReconfiguration-PT-318-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CloudReconfiguration-PT-318-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-318-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2625
rslt: Output for LTLFireability @ CloudReconfiguration-PT-318

{
"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 12:29:57 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"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 (((F (((1 <= p1601))) AND ((1 <= p2130))) OR X (G (((1 <= p1601)))))))",
"processed_size": 75,
"rewrites": 87
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"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": 293
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"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 (X (X (G (((1 <= p993))))))",
"processed_size": 29,
"rewrites": 87
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p592))))",
"processed_size": 21,
"rewrites": 87
},
"result":
{
"edges": 68,
"markings": 68,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p592)) U X (X (((1 <= p1346)))))",
"processed_size": 40,
"rewrites": 87
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G (((p67 <= 0))) AND (((p176 <= 0)) AND X (G (((p176 <= 0)))))))",
"processed_size": 68,
"rewrites": 87
},
"result":
{
"edges": 8106895,
"markings": 2188582,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 382
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((G ((((1 <= p173)) OR (G ((G (((1 <= p173))) AND ((1 <= p894)))) AND F (((1 <= p173)))))) OR ((1 <= p2238)))))",
"processed_size": 116,
"rewrites": 87
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((p1830 <= 0))))",
"processed_size": 22,
"rewrites": 87
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 510
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 3,
"aconj": 4,
"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 ((G ((X (((1 <= p1683))) OR ((1 <= p572) AND (1 <= p2032)))) AND (X (((1 <= p1795))) U G (((1 <= p1795)))))))",
"processed_size": 114,
"rewrites": 87
},
"result":
{
"edges": 76,
"markings": 76,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 23
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 612
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((X (F (((1 <= p1818)))) AND ((1 <= p277)))))",
"processed_size": 50,
"rewrites": 87
},
"result":
{
"edges": 71,
"markings": 71,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 765
},
"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": "((p1009 <= 0))",
"processed_size": 14,
"rewrites": 89
},
"result":
{
"edges": 66,
"markings": 66,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 1020
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G (((p1439 <= 0)))",
"processed_size": 18,
"rewrites": 87
},
"result":
{
"edges": 322454,
"markings": 164304,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((G (((1 <= p720))) AND ((1 <= p161)))))",
"processed_size": 45,
"rewrites": 87
},
"result":
{
"edges": 69,
"markings": 68,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3056
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F (((p2361 <= 0))) AND ((1 <= p292))))",
"processed_size": 42,
"rewrites": 87
},
"result":
{
"edges": 66,
"markings": 66,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((F (((1 <= p1189))) AND ((G (((p1528 <= 0))) AND F (((p1528 <= 0)))) OR X (((1 <= p1189)))))) OR G (((p1388 <= 0)))))",
"processed_size": 124,
"rewrites": 87
},
"result":
{
"edges": 32571167,
"markings": 6680150,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 30
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 100972,
"runtime": 945.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F(*)) AND G((F(*) AND (** AND **)))) : G(F(((F(**) AND **) OR X(G(**))))) : ((F(**) U **) OR X(X(X(G(**))))) : (G(F(**)) OR (** U X(X(**)))) : F((G((F(**) AND ((G(*) AND F(*)) OR X(**)))) OR G(*))) : X((G(*) AND (* AND X(G(*))))) : F(G((G(**) AND **))) : X(G((G((** OR (G((G(**) AND **)) AND F(**)))) OR **))) : F(**) : F((F(*) AND **)) : X(F(**)) : G(*) : X(F((G((X(**) OR **)) AND (X(**) U G(**))))) : G(F((X(F(*)) AND **)))"
},
"net":
{
"arcs": 6479,
"conflict_clusters": 2448,
"places": 2587,
"places_significant": 2583,
"singleton_clusters": 0,
"transitions": 3099
},
"result":
{
"preliminary_value": "no no no no no no no no no no yes no no no ",
"value": "no no no no no no no no no no yes 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: 5686/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2587
lola: finding significant places
lola: 2587 places, 3099 transitions, 2583 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: (p2348 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p1601 <= 1)
lola: LP says that atomic proposition is always true: (p2130 <= 1)
lola: LP says that atomic proposition is always true: (p1601 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1665 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1665 <= 1)
lola: LP says that atomic proposition is always true: (p993 <= 1)
lola: LP says that atomic proposition is always true: (p592 <= 1)
lola: LP says that atomic proposition is always true: (p592 <= 1)
lola: LP says that atomic proposition is always true: (p592 <= 1)
lola: LP says that atomic proposition is always true: (p1346 <= 1)
lola: LP says that atomic proposition is always true: (p1528 <= 1)
lola: LP says that atomic proposition is always true: (p1528 <= 1)
lola: LP says that atomic proposition is always true: (p1189 <= 1)
lola: LP says that atomic proposition is always true: (p1388 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p720 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p894 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p2238 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p1009 <= 1)
lola: LP says that atomic proposition is always true: (p2361 <= 1)
lola: LP says that atomic proposition is always true: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p1830 <= 1)
lola: LP says that atomic proposition is always true: (p1439 <= 1)
lola: LP says that atomic proposition is always true: (p1683 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p2032 <= 1)
lola: LP says that atomic proposition is always true: (p1795 <= 1)
lola: LP says that atomic proposition is always true: (p1795 <= 1)
lola: LP says that atomic proposition is always true: (p1055 <= 1)
lola: LP says that atomic proposition is always true: (p1818 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: (NOT(X (G (((1 <= p2348))))) AND G (((NOT(G (((1 <= p223)))) AND ((p223 <= 0))) AND ((p139 <= 0))))) : F (NOT(F (NOT(X (F (((F (((1 <= p1601))) AND ((1 <= p2130))) OR X (G (((1 <= p1601))))))))))) : ((F (((1 <= p572) AND (1 <= p1665))) U ((1 <= p572) AND (1 <= p1665))) OR X (G (X (X (G (((1 <= p993)))))))) : (G (F (X ((X (((1 <= p592))) U ((1 <= p592)))))) OR (((1 <= p592)) U X (X (((1 <= p1346)))))) : F ((G (((NOT(F (((1 <= p1528)))) AND NOT(G (((1 <= p1528))))) U X (((1 <= p1189))))) OR NOT(F (((1 <= p1388)))))) : (NOT(X ((F (((1 <= p67))) OR ((1 <= p176))))) AND NOT(X (F (X (((1 <= p176))))))) : F (X (F (G (X (G (X ((G (((1 <= p720))) AND ((1 <= p161)))))))))) : G (X ((G ((G ((G (((1 <= p173))) AND ((1 <= p894)))) U ((1 <= p173)))) OR ((1 <= p2238))))) : (((1 <= p45)) U F (((1 <= p1009)))) : F ((NOT(G (((1 <= p2361)))) AND ((1 <= p292)))) : X (F (((p1830 <= 0)))) : NOT(F (((1 <= p1439)))) : F ((X (G ((X (((1 <= p1683))) OR ((1 <= p572) AND (1 <= p2032))))) AND X ((X (((1 <= p1795))) U G (((1 <= p1795))))))) : X (X (G (F ((F ((((1 <= p1055)) U NOT(G (X (((p1818 <= 0))))))) AND ((1 <= p277)))))))
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:350
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p2348 <= 0)))) AND G ((F (((p223 <= 0))) AND (((p223 <= 0)) AND ((p139 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p223 <= 0))) AND (((p223 <= 0)) AND ((p139 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p223 <= 0))) AND (((p223 <= 0)) AND ((p139 <= 0)))))
lola: processed formula length: 61
lola: 87 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: 2956 markings, 4493 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((F (((1 <= p1601))) AND ((1 <= p2130))) OR X (G (((1 <= p1601)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((F (((1 <= p1601))) AND ((1 <= p2130))) OR X (G (((1 <= p1601)))))))
lola: processed formula length: 75
lola: 87 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: 71 markings, 71 edges
lola: ========================================
lola: subprocess 2 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p572) AND (1 <= p1665))) U ((1 <= p572) AND (1 <= p1665))) OR X (X (X (G (((1 <= p993)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p572) AND (1 <= p1665))) U ((1 <= p572) AND (1 <= p1665)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p572) AND (1 <= p1665))) U ((1 <= p572) AND (1 <= p1665)))
lola: processed formula length: 69
lola: 87 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: 65 markings, 65 edges
lola: ========================================
lola: subprocess 3 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G (((1 <= p993))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G (((1 <= p993))))))
lola: processed formula length: 29
lola: 87 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: 71 markings, 71 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p592)))) OR (((1 <= p592)) U X (X (((1 <= p1346))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p592))))
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 <= p592))))
lola: processed formula length: 21
lola: 87 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: 68 markings, 68 edges
lola: ========================================
lola: subprocess 4 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p592)) U X (X (((1 <= p1346)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p592)) U X (X (((1 <= p1346)))))
lola: processed formula length: 40
lola: 87 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: 71 markings, 71 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F (((1 <= p1189))) AND ((G (((p1528 <= 0))) AND F (((p1528 <= 0)))) OR X (((1 <= p1189)))))) OR G (((p1388 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F (((1 <= p1189))) AND ((G (((p1528 <= 0))) AND F (((p1528 <= 0)))) OR X (((1 <= p1189)))))) OR G (((p1388 <= 0)))))
lola: processed formula length: 124
lola: 87 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 114911 markings, 368632 edges, 22982 markings/sec, 0 secs
lola: 228306 markings, 740904 edges, 22679 markings/sec, 5 secs
lola: 312554 markings, 1123667 edges, 16850 markings/sec, 10 secs
lola: 389704 markings, 1503164 edges, 15430 markings/sec, 15 secs
lola: 466872 markings, 1888046 edges, 15434 markings/sec, 20 secs
lola: 543289 markings, 2263847 edges, 15283 markings/sec, 25 secs
lola: 619930 markings, 2633782 edges, 15328 markings/sec, 30 secs
lola: 692290 markings, 3010504 edges, 14472 markings/sec, 35 secs
lola: 785554 markings, 3380165 edges, 18653 markings/sec, 40 secs
lola: 871279 markings, 3755189 edges, 17145 markings/sec, 45 secs
lola: 961160 markings, 4125027 edges, 17976 markings/sec, 50 secs
lola: 1041940 markings, 4498297 edges, 16156 markings/sec, 55 secs
lola: 1162696 markings, 4870958 edges, 24151 markings/sec, 60 secs
lola: 1271768 markings, 5237133 edges, 21814 markings/sec, 65 secs
lola: 1372228 markings, 5614714 edges, 20092 markings/sec, 70 secs
lola: 1453821 markings, 5997600 edges, 16319 markings/sec, 75 secs
lola: 1524683 markings, 6372499 edges, 14172 markings/sec, 80 secs
lola: 1602276 markings, 6753247 edges, 15519 markings/sec, 85 secs
lola: 1677554 markings, 7134702 edges, 15056 markings/sec, 90 secs
lola: 1753273 markings, 7511272 edges, 15144 markings/sec, 95 secs
lola: 1830857 markings, 7888940 edges, 15517 markings/sec, 100 secs
lola: 1918995 markings, 8263583 edges, 17628 markings/sec, 105 secs
lola: 2030483 markings, 8635711 edges, 22298 markings/sec, 110 secs
lola: 2137406 markings, 9004861 edges, 21385 markings/sec, 115 secs
lola: 2256595 markings, 9380507 edges, 23838 markings/sec, 120 secs
lola: 2333665 markings, 9759562 edges, 15414 markings/sec, 125 secs
lola: 2423622 markings, 10143724 edges, 17991 markings/sec, 130 secs
lola: 2490281 markings, 10522922 edges, 13332 markings/sec, 135 secs
lola: 2575710 markings, 10899290 edges, 17086 markings/sec, 140 secs
lola: 2642899 markings, 11273759 edges, 13438 markings/sec, 145 secs
lola: 2728088 markings, 11654588 edges, 17038 markings/sec, 150 secs
lola: 2799841 markings, 12025358 edges, 14351 markings/sec, 155 secs
lola: 2880528 markings, 12397423 edges, 16137 markings/sec, 160 secs
lola: 2959959 markings, 12758066 edges, 15886 markings/sec, 165 secs
lola: 3046239 markings, 13135011 edges, 17256 markings/sec, 170 secs
lola: 3136454 markings, 13511452 edges, 18043 markings/sec, 175 secs
lola: 3227591 markings, 13891202 edges, 18227 markings/sec, 180 secs
lola: 3311686 markings, 14255033 edges, 16819 markings/sec, 185 secs
lola: 3398696 markings, 14627582 edges, 17402 markings/sec, 190 secs
lola: 3465560 markings, 15000832 edges, 13373 markings/sec, 195 secs
lola: 3522315 markings, 15380468 edges, 11351 markings/sec, 200 secs
lola: 3586006 markings, 15757032 edges, 12738 markings/sec, 205 secs
lola: 3645411 markings, 16141665 edges, 11881 markings/sec, 210 secs
lola: 3706378 markings, 16523903 edges, 12193 markings/sec, 215 secs
lola: 3764822 markings, 16906531 edges, 11689 markings/sec, 220 secs
lola: 3824136 markings, 17284444 edges, 11863 markings/sec, 225 secs
lola: 3880757 markings, 17668438 edges, 11324 markings/sec, 230 secs
lola: 3950315 markings, 18050292 edges, 13912 markings/sec, 235 secs
lola: 4022532 markings, 18426825 edges, 14443 markings/sec, 240 secs
lola: 4085938 markings, 18803308 edges, 12681 markings/sec, 245 secs
lola: 4155911 markings, 19174079 edges, 13995 markings/sec, 250 secs
lola: 4219697 markings, 19555251 edges, 12757 markings/sec, 255 secs
lola: 4309284 markings, 19931578 edges, 17917 markings/sec, 260 secs
lola: 4393390 markings, 20304555 edges, 16821 markings/sec, 265 secs
lola: 4482006 markings, 20688772 edges, 17723 markings/sec, 270 secs
lola: 4556094 markings, 21076658 edges, 14818 markings/sec, 275 secs
lola: 4621111 markings, 21465765 edges, 13003 markings/sec, 280 secs
lola: 4673370 markings, 21849836 edges, 10452 markings/sec, 285 secs
lola: 4738275 markings, 22241638 edges, 12981 markings/sec, 290 secs
lola: 4798334 markings, 22636471 edges, 12012 markings/sec, 295 secs
lola: 4857795 markings, 23022431 edges, 11892 markings/sec, 300 secs
lola: 4913047 markings, 23399364 edges, 11050 markings/sec, 305 secs
lola: 4974679 markings, 23790580 edges, 12326 markings/sec, 310 secs
lola: 5038457 markings, 24169997 edges, 12756 markings/sec, 315 secs
lola: 5105114 markings, 24547516 edges, 13331 markings/sec, 320 secs
lola: 5188941 markings, 24928830 edges, 16765 markings/sec, 325 secs
lola: 5277803 markings, 25309083 edges, 17772 markings/sec, 330 secs
lola: 5364533 markings, 25682373 edges, 17346 markings/sec, 335 secs
lola: 5451378 markings, 26063241 edges, 17369 markings/sec, 340 secs
lola: 5512917 markings, 26449884 edges, 12308 markings/sec, 345 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 904036 KB
lola: time consumption: 398 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p67 <= 0))) AND (((p176 <= 0)) AND X (G (((p176 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p67 <= 0))) AND (((p176 <= 0)) AND X (G (((p176 <= 0)))))))
lola: processed formula length: 68
lola: 87 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: 116718 markings, 374196 edges, 23344 markings/sec, 0 secs
lola: 230055 markings, 750987 edges, 22667 markings/sec, 5 secs
lola: 344111 markings, 1114032 edges, 22811 markings/sec, 10 secs
lola: 464483 markings, 1484225 edges, 24074 markings/sec, 15 secs
lola: 574770 markings, 1854356 edges, 22057 markings/sec, 20 secs
lola: 689682 markings, 2225515 edges, 22982 markings/sec, 25 secs
lola: 808239 markings, 2595596 edges, 23711 markings/sec, 30 secs
lola: 917996 markings, 2966852 edges, 21951 markings/sec, 35 secs
lola: 1031470 markings, 3334746 edges, 22695 markings/sec, 40 secs
lola: 1126886 markings, 3702787 edges, 19083 markings/sec, 45 secs
lola: 1213390 markings, 4071642 edges, 17301 markings/sec, 50 secs
lola: 1299384 markings, 4443481 edges, 17199 markings/sec, 55 secs
lola: 1388047 markings, 4810852 edges, 17733 markings/sec, 60 secs
lola: 1486147 markings, 5186504 edges, 19620 markings/sec, 65 secs
lola: 1565888 markings, 5550823 edges, 15948 markings/sec, 70 secs
lola: 1651446 markings, 5923869 edges, 17112 markings/sec, 75 secs
lola: 1741536 markings, 6285409 edges, 18018 markings/sec, 80 secs
lola: 1825119 markings, 6658804 edges, 16717 markings/sec, 85 secs
lola: 1911160 markings, 7024349 edges, 17208 markings/sec, 90 secs
lola: 2002432 markings, 7398540 edges, 18254 markings/sec, 95 secs
lola: 2084397 markings, 7761585 edges, 16393 markings/sec, 100 secs
lola: 2187229 markings, 8103649 edges, 20566 markings/sec, 105 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: 2188582 markings, 8106895 edges
lola: ========================================
lola: subprocess 6 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((((1 <= p173)) OR (G ((G (((1 <= p173))) AND ((1 <= p894)))) AND F (((1 <= p173)))))) OR ((1 <= p2238)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((((1 <= p173)) OR (G ((G (((1 <= p173))) AND ((1 <= p894)))) AND F (((1 <= p173)))))) OR ((1 <= p2238)))))
lola: processed formula length: 116
lola: 87 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: 71 markings, 71 edges
lola: ========================================
lola: subprocess 7 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p1830 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p1830 <= 0))))
lola: processed formula length: 22
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: subprocess 8 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((X (((1 <= p1683))) OR ((1 <= p572) AND (1 <= p2032)))) AND (X (((1 <= p1795))) U G (((1 <= p1795)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((X (((1 <= p1683))) OR ((1 <= p572) AND (1 <= p2032)))) AND (X (((1 <= p1795))) U G (((1 <= p1795)))))))
lola: processed formula length: 114
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 23 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 76 markings, 76 edges
lola: subprocess 9 will run for 612 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (F (((1 <= p1818)))) AND ((1 <= p277)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F (((1 <= p1818)))) AND ((1 <= p277)))))
lola: processed formula length: 50
lola: 87 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: 71 markings, 71 edges
lola: subprocess 10 will run for 765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1009)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1009 <= 0))
lola: processed formula length: 14
lola: 89 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: 66 markings, 66 edges
lola: ========================================
lola: subprocess 11 will run for 1020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p1439 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1439 <= 0)))
lola: processed formula length: 18
lola: 87 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: 164304 markings, 322454 edges
lola: ========================================
lola: subprocess 12 will run for 1528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((1 <= p720))) AND ((1 <= p161)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((1 <= p720))) AND ((1 <= p161)))))
lola: processed formula length: 45
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 68 markings, 69 edges
lola: ========================================
lola: subprocess 13 will run for 3056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p2361 <= 0))) AND ((1 <= p292))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p2361 <= 0))) AND ((1 <= p292))))
lola: processed formula length: 42
lola: 87 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: 66 markings, 66 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G ((F (((1 <= p1189))) AND ((G (((p1528 <= 0))) AND F (((p1528 <= 0)))) OR X (((1 <= p1189)))))) OR G (((p1388 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F (((1 <= p1189))) AND ((G (((p1528 <= 0))) AND F (((p1528 <= 0)))) OR X (((1 <= p1189)))))) OR G (((p1388 <= 0)))))
lola: processed formula length: 124
lola: 87 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 117748 markings, 377604 edges, 23550 markings/sec, 0 secs
lola: 230572 markings, 753873 edges, 22565 markings/sec, 5 secs
lola: 315354 markings, 1137409 edges, 16956 markings/sec, 10 secs
lola: 392901 markings, 1517488 edges, 15509 markings/sec, 15 secs
lola: 469445 markings, 1900793 edges, 15309 markings/sec, 20 secs
lola: 548237 markings, 2284305 edges, 15758 markings/sec, 25 secs
lola: 625821 markings, 2662975 edges, 15517 markings/sec, 30 secs
lola: 698939 markings, 3045061 edges, 14624 markings/sec, 35 secs
lola: 795442 markings, 3422628 edges, 19301 markings/sec, 40 secs
lola: 880406 markings, 3795652 edges, 16993 markings/sec, 45 secs
lola: 971327 markings, 4171239 edges, 18184 markings/sec, 50 secs
lola: 1058997 markings, 4543905 edges, 17534 markings/sec, 55 secs
lola: 1176980 markings, 4915320 edges, 23597 markings/sec, 60 secs
lola: 1287168 markings, 5289636 edges, 22038 markings/sec, 65 secs
lola: 1385631 markings, 5672528 edges, 19693 markings/sec, 70 secs
lola: 1461920 markings, 6059237 edges, 15258 markings/sec, 75 secs
lola: 1539644 markings, 6437044 edges, 15545 markings/sec, 80 secs
lola: 1614579 markings, 6818596 edges, 14987 markings/sec, 85 secs
lola: 1689920 markings, 7203849 edges, 15068 markings/sec, 90 secs
lola: 1769650 markings, 7583755 edges, 15946 markings/sec, 95 secs
lola: 1848444 markings, 7964148 edges, 15759 markings/sec, 100 secs
lola: 1937542 markings, 8343435 edges, 17820 markings/sec, 105 secs
lola: 2052719 markings, 8714866 edges, 23035 markings/sec, 110 secs
lola: 2164037 markings, 9083044 edges, 22264 markings/sec, 115 secs
lola: 2272234 markings, 9449569 edges, 21639 markings/sec, 120 secs
lola: 2349762 markings, 9822902 edges, 15506 markings/sec, 125 secs
lola: 2434367 markings, 10201099 edges, 16921 markings/sec, 130 secs
lola: 2501816 markings, 10578340 edges, 13490 markings/sec, 135 secs
lola: 2590128 markings, 10954803 edges, 17662 markings/sec, 140 secs
lola: 2655382 markings, 11335568 edges, 13051 markings/sec, 145 secs
lola: 2742727 markings, 11714419 edges, 17469 markings/sec, 150 secs
lola: 2814819 markings, 12095416 edges, 14418 markings/sec, 155 secs
lola: 2889361 markings, 12482358 edges, 14908 markings/sec, 160 secs
lola: 2983690 markings, 12857800 edges, 18866 markings/sec, 165 secs
lola: 3067824 markings, 13235045 edges, 16827 markings/sec, 170 secs
lola: 3159652 markings, 13614320 edges, 18366 markings/sec, 175 secs
lola: 3247535 markings, 13987789 edges, 17577 markings/sec, 180 secs
lola: 3337117 markings, 14363139 edges, 17916 markings/sec, 185 secs
lola: 3422113 markings, 14735528 edges, 16999 markings/sec, 190 secs
lola: 3485780 markings, 15120286 edges, 12733 markings/sec, 195 secs
lola: 3542723 markings, 15498066 edges, 11389 markings/sec, 200 secs
lola: 3606320 markings, 15878298 edges, 12719 markings/sec, 205 secs
lola: 3664952 markings, 16268597 edges, 11726 markings/sec, 210 secs
lola: 3723264 markings, 16652986 edges, 11662 markings/sec, 215 secs
lola: 3783851 markings, 17035237 edges, 12117 markings/sec, 220 secs
lola: 3843780 markings, 17416109 edges, 11986 markings/sec, 225 secs
lola: 3903428 markings, 17801058 edges, 11930 markings/sec, 230 secs
lola: 3978192 markings, 18185719 edges, 14953 markings/sec, 235 secs
lola: 4044330 markings, 18567401 edges, 13228 markings/sec, 240 secs
lola: 4110588 markings, 18949736 edges, 13252 markings/sec, 245 secs
lola: 4179132 markings, 19327633 edges, 13709 markings/sec, 250 secs
lola: 4253307 markings, 19706181 edges, 14835 markings/sec, 255 secs
lola: 4341336 markings, 20078487 edges, 17606 markings/sec, 260 secs
lola: 4427081 markings, 20452913 edges, 17149 markings/sec, 265 secs
lola: 4509988 markings, 20824550 edges, 16581 markings/sec, 270 secs
lola: 4579131 markings, 21206763 edges, 13829 markings/sec, 275 secs
lola: 4642116 markings, 21593270 edges, 12597 markings/sec, 280 secs
lola: 4694884 markings, 21975033 edges, 10554 markings/sec, 285 secs
lola: 4757813 markings, 22359811 edges, 12586 markings/sec, 290 secs
lola: 4813433 markings, 22743016 edges, 11124 markings/sec, 295 secs
lola: 4876050 markings, 23130271 edges, 12523 markings/sec, 300 secs
lola: 4932192 markings, 23513955 edges, 11228 markings/sec, 305 secs
lola: 4992263 markings, 23905568 edges, 12014 markings/sec, 310 secs
lola: 5060637 markings, 24292307 edges, 13675 markings/sec, 315 secs
lola: 5128789 markings, 24679725 edges, 13630 markings/sec, 320 secs
lola: 5221955 markings, 25057760 edges, 18633 markings/sec, 325 secs
lola: 5311113 markings, 25425181 edges, 17832 markings/sec, 330 secs
lola: 5392240 markings, 25799843 edges, 16225 markings/sec, 335 secs
lola: 5473565 markings, 26176305 edges, 16265 markings/sec, 340 secs
lola: 5530808 markings, 26558219 edges, 11449 markings/sec, 345 secs
lola: 5599679 markings, 26942640 edges, 13774 markings/sec, 350 secs
lola: 5656679 markings, 27324404 edges, 11400 markings/sec, 355 secs
lola: 5710985 markings, 27705347 edges, 10861 markings/sec, 360 secs
lola: 5779859 markings, 28082387 edges, 13775 markings/sec, 365 secs
lola: 5826624 markings, 28460362 edges, 9353 markings/sec, 370 secs
lola: 5890654 markings, 28837293 edges, 12806 markings/sec, 375 secs
lola: 5949635 markings, 29217441 edges, 11796 markings/sec, 380 secs
lola: 6007894 markings, 29593174 edges, 11652 markings/sec, 385 secs
lola: 6071369 markings, 29971588 edges, 12695 markings/sec, 390 secs
lola: 6131627 markings, 30346492 edges, 12052 markings/sec, 395 secs
lola: 6199697 markings, 30726480 edges, 13614 markings/sec, 400 secs
lola: 6264767 markings, 31105398 edges, 13014 markings/sec, 405 secs
lola: 6334828 markings, 31487676 edges, 14012 markings/sec, 410 secs
lola: 6423076 markings, 31847531 edges, 17650 markings/sec, 415 secs
lola: 6541658 markings, 32183559 edges, 23716 markings/sec, 420 secs
lola: 6653837 markings, 32509162 edges, 22436 markings/sec, 425 secs
lola: add low 1336
lola: add low 1337
lola: add low 1317
lola: add low 1318
lola: add low 1329
lola: add low 1330
lola: add low 1331
lola: add low 1332
lola: add low 1333
lola: add low 1334
lola: add low 1315
lola: add low 1316
lola: add low 1098
lola: add low 1514
lola: add low 1515
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: 6680150 markings, 32571167 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no yes no no no
lola:
preliminary result: no no no no no no no no no no yes no no no
lola: memory consumption: 100972 KB
lola: time consumption: 945 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-318"
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-318, 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-162038334900306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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