Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097100042.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DES-PT-20a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 57K 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 DES-PT-20a-00
FORMULA_NAME DES-PT-20a-01
FORMULA_NAME DES-PT-20a-02
FORMULA_NAME DES-PT-20a-03
FORMULA_NAME DES-PT-20a-04
FORMULA_NAME DES-PT-20a-05
FORMULA_NAME DES-PT-20a-06
FORMULA_NAME DES-PT-20a-07
FORMULA_NAME DES-PT-20a-08
FORMULA_NAME DES-PT-20a-09
FORMULA_NAME DES-PT-20a-10
FORMULA_NAME DES-PT-20a-11
FORMULA_NAME DES-PT-20a-12
FORMULA_NAME DES-PT-20a-13
FORMULA_NAME DES-PT-20a-14
FORMULA_NAME DES-PT-20a-15

=== Now, execution of the tool begins

BK_START 1620506150911

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 20:35:52] [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-08 20:35:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 20:35:52] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-08 20:35:52] [INFO ] Transformed 195 places.
[2021-05-08 20:35:52] [INFO ] Transformed 152 transitions.
[2021-05-08 20:35:52] [INFO ] Found NUPN structural information;
[2021-05-08 20:35:52] [INFO ] Parsed PT model containing 195 places and 152 transitions in 95 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2227 resets, run finished after 468 ms. (steps per millisecond=213 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 20:35:53] [INFO ] Computed 59 place invariants in 21 ms
[2021-05-08 20:35:53] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2021-05-08 20:35:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2021-05-08 20:35:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:53] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-08 20:35:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 26 ms returned sat
[2021-05-08 20:35:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2021-05-08 20:35:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:53] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-08 20:35:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 20:35:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:53] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 18 ms.
[2021-05-08 20:35:54] [INFO ] Added : 128 causal constraints over 26 iterations in 411 ms. Result :sat
[2021-05-08 20:35:54] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:54] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-08 20:35:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:54] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:54] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:35:54] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:35:55] [INFO ] Added : 101 causal constraints over 21 iterations in 345 ms. Result :sat
[2021-05-08 20:35:55] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2021-05-08 20:35:55] [INFO ] Deduced a trap composed of 9 places in 46 ms
[2021-05-08 20:35:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2021-05-08 20:35:55] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:35:55] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:55] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-08 20:35:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:35:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2021-05-08 20:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:55] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-08 20:35:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:35:55] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2021-05-08 20:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-08 20:35:55] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:35:56] [INFO ] Added : 128 causal constraints over 26 iterations in 421 ms. Result :sat
[2021-05-08 20:35:56] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:56] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-08 20:35:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:35:56] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2021-05-08 20:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:56] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-08 20:35:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:56] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:35:57] [INFO ] Added : 93 causal constraints over 19 iterations in 327 ms. Result :sat
[2021-05-08 20:35:57] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2021-05-08 20:35:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-08 20:35:57] [INFO ] [Real]Absence check using 34 positive place invariants in 26 ms returned sat
[2021-05-08 20:35:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:57] [INFO ] [Real]Absence check using state equation in 47 ms returned unsat
[2021-05-08 20:35:57] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:57] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-08 20:35:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:35:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-08 20:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:57] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-08 20:35:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:57] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:35:58] [INFO ] Added : 117 causal constraints over 24 iterations in 343 ms. Result :sat
[2021-05-08 20:35:58] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2021-05-08 20:35:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:58] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-08 20:35:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:35:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 20:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:58] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-08 20:35:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:58] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 11 ms.
[2021-05-08 20:35:59] [INFO ] Added : 132 causal constraints over 27 iterations in 676 ms. Result :sat
[2021-05-08 20:35:59] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:35:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:59] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-08 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:35:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2021-05-08 20:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:59] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-08 20:35:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:59] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:36:00] [INFO ] Added : 119 causal constraints over 25 iterations in 360 ms. Result :sat
[2021-05-08 20:36:00] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:00] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-08 20:36:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2021-05-08 20:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:00] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2021-05-08 20:36:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:00] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:01] [INFO ] Added : 119 causal constraints over 25 iterations in 342 ms. Result :sat
[2021-05-08 20:36:01] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:01] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-08 20:36:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 20:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:01] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2021-05-08 20:36:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:01] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:01] [INFO ] Added : 121 causal constraints over 25 iterations in 367 ms. Result :sat
[2021-05-08 20:36:01] [INFO ] Deduced a trap composed of 15 places in 28 ms
[2021-05-08 20:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-08 20:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:02] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 8 ms.
[2021-05-08 20:36:02] [INFO ] Added : 79 causal constraints over 16 iterations in 229 ms. Result :sat
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:02] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-08 20:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 20:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:03] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-08 20:36:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-08 20:36:03] [INFO ] Deduced a trap composed of 9 places in 26 ms
[2021-05-08 20:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-08 20:36:03] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:03] [INFO ] Added : 130 causal constraints over 26 iterations in 421 ms. Result :sat
[2021-05-08 20:36:03] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:03] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-08 20:36:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 59 ms returned sat
[2021-05-08 20:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:04] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:04] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:04] [INFO ] Added : 83 causal constraints over 17 iterations in 268 ms. Result :sat
[2021-05-08 20:36:04] [INFO ] Deduced a trap composed of 13 places in 21 ms
[2021-05-08 20:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using state equation in 46 ms returned unsat
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:04] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-08 20:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:04] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-08 20:36:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:04] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:05] [INFO ] Added : 90 causal constraints over 19 iterations in 294 ms. Result :sat
[2021-05-08 20:36:05] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:05] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-08 20:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 82 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:05] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2021-05-08 20:36:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:05] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 15 ms.
[2021-05-08 20:36:06] [INFO ] Added : 104 causal constraints over 21 iterations in 279 ms. Result :sat
[2021-05-08 20:36:06] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:06] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-08 20:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 68 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:06] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-08 20:36:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:06] [INFO ] Deduced a trap composed of 9 places in 44 ms
[2021-05-08 20:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-08 20:36:06] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:36:06] [INFO ] Added : 108 causal constraints over 23 iterations in 306 ms. Result :sat
[2021-05-08 20:36:07] [INFO ] Deduced a trap composed of 10 places in 47 ms
[2021-05-08 20:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-08 20:36:07] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:07] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-08 20:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:07] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:07] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:36:07] [INFO ] Added : 91 causal constraints over 19 iterations in 246 ms. Result :sat
[2021-05-08 20:36:07] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:07] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-08 20:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:36:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:36:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 20:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:36:08] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2021-05-08 20:36:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:36:08] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 8 ms.
[2021-05-08 20:36:08] [INFO ] Added : 106 causal constraints over 22 iterations in 379 ms. Result :sat
[2021-05-08 20:36:08] [INFO ] Deduced a trap composed of 16 places in 32 ms
[2021-05-08 20:36:08] [INFO ] Deduced a trap composed of 17 places in 30 ms
[2021-05-08 20:36:08] [INFO ] Deduced a trap composed of 10 places in 38 ms
[2021-05-08 20:36:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-08 20:36:08] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-08 20:36:08] [INFO ] Flatten gal took : 51 ms
FORMULA DES-PT-20a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 20:36:08] [INFO ] Applying decomposition
[2021-05-08 20:36:09] [INFO ] Flatten gal took : 19 ms
[2021-05-08 20:36:09] [INFO ] Decomposing Gal with order
[2021-05-08 20:36:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 20:36:09] [INFO ] Removed a total of 153 redundant transitions.
[2021-05-08 20:36:09] [INFO ] Flatten gal took : 72 ms
[2021-05-08 20:36:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 11 ms.
[2021-05-08 20:36:09] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-08 20:36:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DES-PT-20a @ 3570 seconds

FORMULA DES-PT-20a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ DES-PT-20a

{
"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": "Sat May 8 20:36:10 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((X (X (F ((G (((1 <= p24) AND (1 <= p190))) AND ((1 <= p112) AND (1 <= p175)))))) OR G (((1 <= p75) AND (1 <= p85)))))",
"processed_size": 121,
"rewrites": 72
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "((1 <= p14) AND ((p97 <= 0)) AND (1 <= p113) AND (1 <= p115))",
"processed_size": 61,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "((p14 <= 0) OR ((1 <= p97)) OR (p113 <= 0) OR (p115 <= 0))",
"processed_size": 61,
"rewrites": 74
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((X (X (F (((p170 <= 0) OR (p173 <= 0))))) OR F (G (((1 <= p170) AND (1 <= p173)))))) AND X (((1 <= p170) AND (1 <= p173)))))",
"processed_size": 132,
"rewrites": 72
},
"result":
{
"edges": 45,
"markings": 45,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p86) AND (1 <= p108))))",
"processed_size": 36,
"rewrites": 72
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 3,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X ((((1 <= p81) AND (1 <= p83) AND (1 <= p87) AND (1 <= p88) AND (1 <= p90) AND (1 <= p92)) OR (F (((1 <= p102) AND (1 <= p107) AND (1 <= p109))) OR X (F ((G (((p81 <= 0) OR (p83 <= 0) OR (p87 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p92 <= 0))) OR (((p91 <= 0) OR (p185 <= 0)) AND ((p81 <= 0) OR (p83 <= 0) OR (p87 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p92 <= 0)))))))))",
"processed_size": 379,
"rewrites": 72
},
"result":
{
"edges": 154119,
"markings": 50629,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p114) AND (1 <= p186))))",
"processed_size": 37,
"rewrites": 72
},
"result":
{
"edges": 36,
"markings": 36,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 (((p84 <= 0)))",
"processed_size": 16,
"rewrites": 72
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p118) AND (1 <= p187)) U G ((((1 <= p82) AND (1 <= p95)) OR (G (F (((1 <= p44) AND (1 <= p110)))) AND F (((1 <= p82) AND (1 <= p95)))))))",
"processed_size": 145,
"rewrites": 72
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"compoundnumber": 10,
"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": 3566
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p45) AND (1 <= p110))))",
"processed_size": 36,
"rewrites": 72
},
"result":
{
"edges": 26,
"markings": 26,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 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": 4,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p45) AND (1 <= p110) AND (1 <= p77) AND (1 <= p85))))",
"processed_size": 66,
"rewrites": 72
},
"result":
{
"edges": 27,
"markings": 26,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 47320,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((X(X(F((G(**) AND **)))) OR G(**))) : (G(F(**)) OR F(G(**))) : (X(X(F(**))) OR G(**)) : (** U G((** OR (G(F(**)) AND F(**))))) : (G((X(*) AND (F(*) OR X(G(*))))) AND F(**)) : G(*) : (** OR (G((G(**) OR X(**))) AND F(**))) : G((F(G(((F(**) AND (** AND **)) OR **))) AND X(*))) : G((F((X(X(F(*))) OR F(G(**)))) AND X(**))) : X(G(**)) : X((** OR (F(**) OR X(F((G(*) OR (* AND *))))))) : G(F(**))"
},
"net":
{
"arcs": 678,
"conflict_clusters": 46,
"places": 195,
"places_significant": 136,
"singleton_clusters": 0,
"transitions": 138
},
"result":
{
"preliminary_value": "no no no no no no no no no no yes no ",
"value": "no no no no no no no no no no yes 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: 333/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 195
lola: finding significant places
lola: 195 places, 138 transitions, 136 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: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: F ((X (F ((X (G (((1 <= p24) AND (1 <= p190)))) AND X (((1 <= p112) AND (1 <= p175)))))) OR G (((1 <= p75) AND (1 <= p85))))) : (G (F (((1 <= p45) AND (1 <= p110)))) OR F (G (G (X (((1 <= p45) AND (1 <= p110) AND (1 <= p77) AND (1 <= p85))))))) : (F (X (X (((1 <= p102) AND (1 <= p107) AND (1 <= p109))))) OR G (((p28 <= 0) OR (p190 <= 0)))) : (((1 <= p118) AND (1 <= p187)) U G ((G (F (((1 <= p44) AND (1 <= p110)))) U ((1 <= p82) AND (1 <= p95))))) : (NOT(F ((G (((1 <= p9) AND (1 <= p113) AND (1 <= p115))) U X (((p9 <= 0) OR (p113 <= 0) OR (p115 <= 0)))))) AND F (((1 <= p55) AND (1 <= p110)))) : G (NOT(F ((((p89 <= 0) OR (p174 <= 0)) U ((1 <= p84)))))) : (G ((G (((1 <= p97) AND (1 <= p15) AND (1 <= p113) AND (1 <= p115))) OR X (((1 <= p93) AND (1 <= p103) AND (1 <= p105))))) U ((1 <= p14) AND ((p97 <= 0)) AND (1 <= p113) AND (1 <= p115))) : NOT(F ((G (F (NOT(G ((((F (((1 <= p78) AND (1 <= p85))) AND ((1 <= p146))) AND ((1 <= p162))) OR ((1 <= p146) AND (1 <= p162))))))) OR X (((1 <= p78) AND (1 <= p85)))))) : G ((F ((NOT(G (X (X (((1 <= p170) AND (1 <= p173)))))) OR F (G (((1 <= p170) AND (1 <= p173)))))) AND X (((1 <= p170) AND (1 <= p173))))) : G (X (((1 <= p86) AND (1 <= p108)))) : (X (((1 <= p81) AND (1 <= p83) AND (1 <= p87) AND (1 <= p88) AND (1 <= p90) AND (1 <= p92))) OR X ((F (((1 <= p102) AND (1 <= p107) AND (1 <= p109))) OR NOT(G (X ((((1 <= p91) AND (1 <= p185)) U ((1 <= p81) AND (1 <= p83) AND (1 <= p87) AND (1 <= p88) AND (1 <= p90) AND (1 <= p92))))))))) : F (G (F (((1 <= p114) AND (1 <= p186)))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F ((G (((1 <= p24) AND (1 <= p190))) AND ((1 <= p112) AND (1 <= p175)))))) OR G (((1 <= p75) AND (1 <= p85)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F ((G (((1 <= p24) AND (1 <= p190))) AND ((1 <= p112) AND (1 <= p175)))))) OR G (((1 <= p75) AND (1 <= p85)))))
lola: processed formula length: 121
lola: 72 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: 46 markings, 46 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((1 <= p102) AND (1 <= p107) AND (1 <= p109))))) OR G (((p28 <= 0) OR (p190 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p28 <= 0) OR (p190 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p28 <= 0) OR (p190 <= 0)))
lola: processed formula length: 32
lola: 72 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: 2354 markings, 2595 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p102) AND (1 <= p107) AND (1 <= p109)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p102) AND (1 <= p107) AND (1 <= p109)))))
lola: processed formula length: 57
lola: 72 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: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X (((1 <= p9) AND (1 <= p113) AND (1 <= p115))) AND (F (((p9 <= 0) OR (p113 <= 0) OR (p115 <= 0))) OR X (G (((1 <= p9) AND (1 <= p113) AND (1 <= p115))))))) AND F (((1 <= p55) AND (1 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p55) AND (1 <= p110)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p55 <= 0) OR (p110 <= 0))
lola: processed formula length: 28
lola: 74 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: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p14) AND ((p97 <= 0)) AND (1 <= p113) AND (1 <= p115)) OR (G ((G (((1 <= p97) AND (1 <= p15) AND (1 <= p113) AND (1 <= p115))) OR X (((1 <= p93) AND (1 <= p103) AND (1 <= p105))))) AND F (((1 <= p14) AND ((p97 <= 0)) AND (1 <= p113) AND (1 <= p115)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p14) AND ((p97 <= 0)) AND (1 <= p113) AND (1 <= p115))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p14) AND ((p97 <= 0)) AND (1 <= p113) AND (1 <= p115))
lola: processed formula length: 61
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p14) AND ((p97 <= 0)) AND (1 <= p113) AND (1 <= p115)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p14 <= 0) OR ((1 <= p97)) OR (p113 <= 0) OR (p115 <= 0))
lola: processed formula length: 61
lola: 74 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: 27 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G (((F (((1 <= p78) AND (1 <= p85))) AND (((1 <= p146)) AND ((1 <= p162)))) OR ((1 <= p146) AND (1 <= p162))))) AND X (((p78 <= 0) OR (p85 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G (((F (((1 <= p78) AND (1 <= p85))) AND (((1 <= p146)) AND ((1 <= p162)))) OR ((1 <= p146) AND (1 <= p162))))) AND X (((p78 <= 0) OR (p85 <= 0)))))
lola: processed formula length: 156
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 218 markings, 791 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((X (X (F (((p170 <= 0) OR (p173 <= 0))))) OR F (G (((1 <= p170) AND (1 <= p173)))))) AND X (((1 <= p170) AND (1 <= p173)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((X (X (F (((p170 <= 0) OR (p173 <= 0))))) OR F (G (((1 <= p170) AND (1 <= p173)))))) AND X (((1 <= p170) AND (1 <= p173)))))
lola: processed formula length: 132
lola: 72 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p86) AND (1 <= p108))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p86) AND (1 <= p108))))
lola: processed formula length: 36
lola: 72 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p81) AND (1 <= p83) AND (1 <= p87) AND (1 <= p88) AND (1 <= p90) AND (1 <= p92)) OR (F (((1 <= p102) AND (1 <= p107) AND (1 <= p109))) OR X (F ((G (((p81 <= 0) OR (p83 <= 0) OR (p87 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p92 <= 0))) OR (((p91 <= 0) OR (p185 <= 0)) AND ((p81 <= 0) OR (p83 <= 0) OR (p87 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p92 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p81) AND (1 <= p83) AND (1 <= p87) AND (1 <= p88) AND (1 <= p90) AND (1 <= p92)) OR (F (((1 <= p102) AND (1 <= p107) AND (1 <= p109))) OR X (F ((G (((p81 <= 0) OR (p83 <= 0) OR (p87 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p92 <= 0))) OR (((p91 <= 0) OR (p185 <= 0)) AND ((p81 <= 0) OR (p83 <= 0) OR (p87 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p92 <= 0)))))))))
lola: processed formula length: 379
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 50629 markings, 154119 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p114) AND (1 <= p186))))
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 <= p114) AND (1 <= p186))))
lola: processed formula length: 37
lola: 72 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: 36 markings, 36 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p84 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p84 <= 0)))
lola: processed formula length: 16
lola: 72 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p118) AND (1 <= p187)) U G ((((1 <= p82) AND (1 <= p95)) OR (G (F (((1 <= p44) AND (1 <= p110)))) AND F (((1 <= p82) AND (1 <= p95)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p118) AND (1 <= p187)) U G ((((1 <= p82) AND (1 <= p95)) OR (G (F (((1 <= p44) AND (1 <= p110)))) AND F (((1 <= p82) AND (1 <= p95)))))))
lola: processed formula length: 145
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 20 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p45) AND (1 <= p110)))) OR F (G (((1 <= p45) AND (1 <= p110) AND (1 <= p77) AND (1 <= p85)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p45) AND (1 <= p110))))
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 <= p45) AND (1 <= p110))))
lola: processed formula length: 36
lola: 72 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: 26 markings, 26 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p45) AND (1 <= p110)))) OR F (G (((1 <= p45) AND (1 <= p110) AND (1 <= p77) AND (1 <= p85)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p45) AND (1 <= p110))))
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 <= p45) AND (1 <= p110))))
lola: processed formula length: 36
lola: 72 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: 26 markings, 26 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p45) AND (1 <= p110) AND (1 <= p77) AND (1 <= p85))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p45) AND (1 <= p110) AND (1 <= p77) AND (1 <= p85))))
lola: processed formula length: 66
lola: 72 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: 26 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no yes no
lola:
preliminary result: no no no no no no no no no no yes no
lola: memory consumption: 47320 KB
lola: time consumption: 4 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="DES-PT-20a"
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 DES-PT-20a, 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 r075-tall-162039097100042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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