Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928900660.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is LamportFastMutEx-PT-4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928900660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.6K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 110K Apr 30 13:04 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 LamportFastMutEx-PT-4-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-4-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591218214057

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:03:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 21:03:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:03:37] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-06-03 21:03:37] [INFO ] Transformed 135 places.
[2020-06-03 21:03:37] [INFO ] Transformed 230 transitions.
[2020-06-03 21:03:37] [INFO ] Parsed PT model containing 135 places and 230 transitions in 88 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 36 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 318 ms. (steps per millisecond=314 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1]
[2020-06-03 21:03:37] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2020-06-03 21:03:37] [INFO ] Computed 26 place invariants in 6 ms
[2020-06-03 21:03:37] [INFO ] [Real]Absence check using 26 positive place invariants in 23 ms returned sat
[2020-06-03 21:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:37] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-03 21:03:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2020-06-03 21:03:37] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:03:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 57 ms returned sat
[2020-06-03 21:03:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:38] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-06-03 21:03:38] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 11 places in 105 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 19 places in 151 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 14 places in 78 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 13 places in 43 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 17 places in 52 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 13 places in 25 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 17 places in 46 ms
[2020-06-03 21:03:38] [INFO ] Deduced a trap composed of 9 places in 30 ms
[2020-06-03 21:03:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 851 ms
[2020-06-03 21:03:38] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 7 ms.
[2020-06-03 21:03:39] [INFO ] Added : 130 causal constraints over 27 iterations in 621 ms. Result :sat
[2020-06-03 21:03:39] [INFO ] [Real]Absence check using 26 positive place invariants in 102 ms returned sat
[2020-06-03 21:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:39] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-06-03 21:03:39] [INFO ] [Real]Added 48 Read/Feed constraints in 21 ms returned sat
[2020-06-03 21:03:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:40] [INFO ] [Nat]Absence check using 26 positive place invariants in 44 ms returned sat
[2020-06-03 21:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:40] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2020-06-03 21:03:40] [INFO ] [Nat]Added 48 Read/Feed constraints in 18 ms returned sat
[2020-06-03 21:03:40] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-06-03 21:03:40] [INFO ] Deduced a trap composed of 14 places in 74 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 22 places in 658 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 14 places in 392 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 23 places in 45 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 8 places in 13 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 26 places in 67 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 13 places in 25 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 8 places in 18 ms
[2020-06-03 21:03:41] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 14 places in 47 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 9 places in 56 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 13 places in 38 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 14 places in 28 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 13 places in 51 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 23 places in 30 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 18 places in 54 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 14 places in 24 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 18 places in 37 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 13 places in 20 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 8 places in 25 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 25 places in 33 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 14 places in 42 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 22 places in 60 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 15 places in 72 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 17 places in 34 ms
[2020-06-03 21:03:42] [INFO ] Deduced a trap composed of 22 places in 29 ms
[2020-06-03 21:03:43] [INFO ] Deduced a trap composed of 14 places in 428 ms
[2020-06-03 21:03:43] [INFO ] Deduced a trap composed of 13 places in 47 ms
[2020-06-03 21:03:43] [INFO ] Deduced a trap composed of 13 places in 111 ms
[2020-06-03 21:03:43] [INFO ] Deduced a trap composed of 9 places in 47 ms
[2020-06-03 21:03:43] [INFO ] Deduced a trap composed of 14 places in 67 ms
[2020-06-03 21:03:43] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2020-06-03 21:03:43] [INFO ] Deduced a trap composed of 21 places in 46 ms
[2020-06-03 21:03:43] [INFO ] Deduced a trap composed of 13 places in 34 ms
[2020-06-03 21:03:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 40 trap constraints in 3545 ms
[2020-06-03 21:03:43] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2020-06-03 21:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:43] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-03 21:03:43] [INFO ] [Real]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-06-03 21:03:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:44] [INFO ] [Nat]Absence check using 26 positive place invariants in 137 ms returned sat
[2020-06-03 21:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:44] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2020-06-03 21:03:44] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2020-06-03 21:03:44] [INFO ] Deduced a trap composed of 9 places in 189 ms
[2020-06-03 21:03:44] [INFO ] Deduced a trap composed of 11 places in 237 ms
[2020-06-03 21:03:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 440 ms
[2020-06-03 21:03:44] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2020-06-03 21:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:44] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-06-03 21:03:44] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-06-03 21:03:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:44] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2020-06-03 21:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:44] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-03 21:03:44] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 8 places in 554 ms
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 10 places in 46 ms
[2020-06-03 21:03:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 609 ms
[2020-06-03 21:03:45] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2020-06-03 21:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:45] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-03 21:03:45] [INFO ] [Real]Added 48 Read/Feed constraints in 4 ms returned sat
[2020-06-03 21:03:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:45] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2020-06-03 21:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:45] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-03 21:03:45] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 19 places in 42 ms
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 13 places in 25 ms
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 12 places in 24 ms
[2020-06-03 21:03:45] [INFO ] Deduced a trap composed of 12 places in 30 ms
[2020-06-03 21:03:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 301 ms
[2020-06-03 21:03:45] [INFO ] [Real]Absence check using 26 positive place invariants in 16 ms returned sat
[2020-06-03 21:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:45] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-06-03 21:03:45] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:03:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:46] [INFO ] [Nat]Absence check using 26 positive place invariants in 17 ms returned sat
[2020-06-03 21:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:46] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2020-06-03 21:03:46] [INFO ] [Nat]Added 48 Read/Feed constraints in 4 ms returned sat
[2020-06-03 21:03:46] [INFO ] Deduced a trap composed of 11 places in 35 ms
[2020-06-03 21:03:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2020-06-03 21:03:46] [INFO ] [Real]Absence check using 26 positive place invariants in 190 ms returned sat
[2020-06-03 21:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:46] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2020-06-03 21:03:46] [INFO ] [Real]Added 48 Read/Feed constraints in 7 ms returned sat
[2020-06-03 21:03:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:47] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2020-06-03 21:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:47] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-03 21:03:47] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 6 places in 56 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2020-06-03 21:03:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 92 ms
[2020-06-03 21:03:47] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2020-06-03 21:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:47] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-03 21:03:47] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-06-03 21:03:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:47] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2020-06-03 21:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:47] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-03 21:03:47] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 6 places in 47 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 8 places in 74 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 6 places in 85 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 16 places in 31 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 10 places in 56 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 11 places in 57 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 8 places in 18 ms
[2020-06-03 21:03:47] [INFO ] Deduced a trap composed of 6 places in 14 ms
[2020-06-03 21:03:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 652 ms
[2020-06-03 21:03:48] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 11 ms.
[2020-06-03 21:03:48] [INFO ] Added : 20 causal constraints over 4 iterations in 87 ms. Result :unsat
[2020-06-03 21:03:48] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2020-06-03 21:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:48] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2020-06-03 21:03:48] [INFO ] [Real]Added 48 Read/Feed constraints in 21 ms returned sat
[2020-06-03 21:03:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:48] [INFO ] [Nat]Absence check using 26 positive place invariants in 80 ms returned sat
[2020-06-03 21:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:48] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-06-03 21:03:48] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-06-03 21:03:48] [INFO ] Deduced a trap composed of 9 places in 245 ms
[2020-06-03 21:03:50] [INFO ] Deduced a trap composed of 10 places in 1363 ms
[2020-06-03 21:03:50] [INFO ] Deduced a trap composed of 6 places in 889 ms
[2020-06-03 21:03:51] [INFO ] Deduced a trap composed of 6 places in 781 ms
[2020-06-03 21:03:53] [INFO ] Deduced a trap composed of 6 places in 1369 ms
[2020-06-03 21:03:53] [INFO ] Deduced a trap composed of 9 places in 37 ms
[2020-06-03 21:03:53] [INFO ] Deduced a trap composed of 6 places in 38 ms
[2020-06-03 21:03:53] [INFO ] Deduced a trap composed of 9 places in 31 ms
[2020-06-03 21:03:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 4851 ms
[2020-06-03 21:03:53] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2020-06-03 21:03:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:53] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-03 21:03:53] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:03:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:53] [INFO ] [Nat]Absence check using 26 positive place invariants in 13 ms returned sat
[2020-06-03 21:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:53] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-06-03 21:03:53] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2020-06-03 21:03:53] [INFO ] Deduced a trap composed of 6 places in 54 ms
[2020-06-03 21:03:53] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2020-06-03 21:03:54] [INFO ] Deduced a trap composed of 6 places in 334 ms
[2020-06-03 21:03:54] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2020-06-03 21:03:54] [INFO ] Deduced a trap composed of 6 places in 155 ms
[2020-06-03 21:03:54] [INFO ] Deduced a trap composed of 17 places in 34 ms
[2020-06-03 21:03:54] [INFO ] Deduced a trap composed of 6 places in 33 ms
[2020-06-03 21:03:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 880 ms
[2020-06-03 21:03:54] [INFO ] [Real]Absence check using 26 positive place invariants in 172 ms returned sat
[2020-06-03 21:03:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:55] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2020-06-03 21:03:55] [INFO ] [Real]Added 48 Read/Feed constraints in 30 ms returned sat
[2020-06-03 21:03:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:55] [INFO ] [Nat]Absence check using 26 positive place invariants in 111 ms returned sat
[2020-06-03 21:03:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:55] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2020-06-03 21:03:55] [INFO ] [Nat]Added 48 Read/Feed constraints in 18 ms returned sat
[2020-06-03 21:03:55] [INFO ] Deduced a trap composed of 12 places in 120 ms
[2020-06-03 21:03:56] [INFO ] Deduced a trap composed of 10 places in 669 ms
[2020-06-03 21:03:56] [INFO ] Deduced a trap composed of 25 places in 107 ms
[2020-06-03 21:03:56] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2020-06-03 21:03:56] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2020-06-03 21:03:56] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2020-06-03 21:03:56] [INFO ] Deduced a trap composed of 12 places in 37 ms
[2020-06-03 21:03:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1156 ms
[2020-06-03 21:03:56] [INFO ] [Real]Absence check using 26 positive place invariants in 18 ms returned sat
[2020-06-03 21:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:56] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2020-06-03 21:03:56] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2020-06-03 21:03:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:57] [INFO ] [Nat]Absence check using 26 positive place invariants in 11 ms returned sat
[2020-06-03 21:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:57] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-03 21:03:57] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2020-06-03 21:03:58] [INFO ] Deduced a trap composed of 12 places in 1492 ms
[2020-06-03 21:03:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1496 ms
[2020-06-03 21:03:58] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned sat
[2020-06-03 21:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:58] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-06-03 21:03:58] [INFO ] [Real]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:03:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:03:58] [INFO ] [Nat]Absence check using 26 positive place invariants in 18 ms returned sat
[2020-06-03 21:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:03:58] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2020-06-03 21:03:58] [INFO ] [Nat]Added 48 Read/Feed constraints in 31 ms returned sat
[2020-06-03 21:04:00] [INFO ] Deduced a trap composed of 9 places in 1244 ms
[2020-06-03 21:04:00] [INFO ] Deduced a trap composed of 11 places in 35 ms
[2020-06-03 21:04:00] [INFO ] Deduced a trap composed of 12 places in 576 ms
[2020-06-03 21:04:00] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2020-06-03 21:04:00] [INFO ] Deduced a trap composed of 11 places in 52 ms
[2020-06-03 21:04:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 2031 ms
[2020-06-03 21:04:00] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2020-06-03 21:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:00] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-06-03 21:04:01] [INFO ] [Real]Added 48 Read/Feed constraints in 14 ms returned sat
[2020-06-03 21:04:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:04:01] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2020-06-03 21:04:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:01] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-06-03 21:04:01] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2020-06-03 21:04:01] [INFO ] Deduced a trap composed of 17 places in 104 ms
[2020-06-03 21:04:01] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2020-06-03 21:04:02] [INFO ] Deduced a trap composed of 10 places in 791 ms
[2020-06-03 21:04:02] [INFO ] Deduced a trap composed of 11 places in 59 ms
[2020-06-03 21:04:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1078 ms
[2020-06-03 21:04:02] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2020-06-03 21:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:02] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-03 21:04:02] [INFO ] [Real]Added 48 Read/Feed constraints in 7 ms returned sat
[2020-06-03 21:04:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:04:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 156 ms returned sat
[2020-06-03 21:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:03] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2020-06-03 21:04:03] [INFO ] [Nat]Added 48 Read/Feed constraints in 26 ms returned sat
[2020-06-03 21:04:04] [INFO ] Deduced a trap composed of 12 places in 1384 ms
[2020-06-03 21:04:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1394 ms
[2020-06-03 21:04:04] [INFO ] [Real]Absence check using 26 positive place invariants in 33 ms returned sat
[2020-06-03 21:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:04] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-06-03 21:04:04] [INFO ] [Real]Added 48 Read/Feed constraints in 11 ms returned sat
[2020-06-03 21:04:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:04:04] [INFO ] [Nat]Absence check using 26 positive place invariants in 51 ms returned sat
[2020-06-03 21:04:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:05] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2020-06-03 21:04:05] [INFO ] [Nat]Added 48 Read/Feed constraints in 27 ms returned sat
[2020-06-03 21:04:06] [INFO ] Deduced a trap composed of 20 places in 931 ms
[2020-06-03 21:04:06] [INFO ] Deduced a trap composed of 25 places in 648 ms
[2020-06-03 21:04:06] [INFO ] Deduced a trap composed of 12 places in 75 ms
[2020-06-03 21:04:06] [INFO ] Deduced a trap composed of 13 places in 74 ms
[2020-06-03 21:04:07] [INFO ] Deduced a trap composed of 10 places in 39 ms
[2020-06-03 21:04:07] [INFO ] Deduced a trap composed of 11 places in 466 ms
[2020-06-03 21:04:07] [INFO ] Deduced a trap composed of 9 places in 22 ms
[2020-06-03 21:04:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 2348 ms
[2020-06-03 21:04:07] [INFO ] [Real]Absence check using 26 positive place invariants in 163 ms returned sat
[2020-06-03 21:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:07] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2020-06-03 21:04:07] [INFO ] [Real]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-06-03 21:04:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:04:07] [INFO ] [Nat]Absence check using 26 positive place invariants in 119 ms returned sat
[2020-06-03 21:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:08] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-06-03 21:04:08] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2020-06-03 21:04:08] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2020-06-03 21:04:08] [INFO ] Deduced a trap composed of 19 places in 37 ms
[2020-06-03 21:04:08] [INFO ] Deduced a trap composed of 9 places in 71 ms
[2020-06-03 21:04:08] [INFO ] Deduced a trap composed of 13 places in 71 ms
[2020-06-03 21:04:08] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-03 21:04:08] [INFO ] Deduced a trap composed of 12 places in 47 ms
[2020-06-03 21:04:09] [INFO ] Deduced a trap composed of 12 places in 71 ms
[2020-06-03 21:04:09] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-06-03 21:04:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 588 ms
[2020-06-03 21:04:09] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2020-06-03 21:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:09] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-03 21:04:09] [INFO ] [Real]Added 48 Read/Feed constraints in 8 ms returned sat
[2020-06-03 21:04:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:04:09] [INFO ] [Nat]Absence check using 26 positive place invariants in 20 ms returned sat
[2020-06-03 21:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:04:09] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2020-06-03 21:04:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 21 ms returned sat
[2020-06-03 21:04:09] [INFO ] Deduced a trap composed of 19 places in 122 ms
[2020-06-03 21:04:10] [INFO ] Deduced a trap composed of 22 places in 695 ms
[2020-06-03 21:04:11] [INFO ] Deduced a trap composed of 22 places in 1354 ms
[2020-06-03 21:04:12] [INFO ] Deduced a trap composed of 22 places in 1319 ms
[2020-06-03 21:04:14] [INFO ] Deduced a trap composed of 15 places in 1290 ms
[2020-06-03 21:04:15] [INFO ] Deduced a trap composed of 8 places in 1182 ms
[2020-06-03 21:04:15] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-06-03 21:04:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6188 ms
[2020-06-03 21:04:15] [INFO ] Computed and/alt/rep : 176/848/140 causal constraints in 13 ms.
[2020-06-03 21:04:16] [INFO ] Added : 134 causal constraints over 27 iterations in 491 ms. Result :sat
Successfully simplified 16 atomic propositions for a total of 17 simplifications.
[2020-06-03 21:04:16] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:04:16] [INFO ] Flatten gal took : 98 ms
[2020-06-03 21:04:16] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:04:16] [INFO ] Flatten gal took : 23 ms
FORMULA LamportFastMutEx-PT-4-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:04:16] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 24 ms.
[2020-06-03 21:04:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ LamportFastMutEx-PT-4 @ 3570 seconds

FORMULA LamportFastMutEx-PT-4-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3511
rslt: Output for CTLFireability @ LamportFastMutEx-PT-4

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 21:04:17 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 25,
"aneg": 1,
"comp": 64,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)) OR ((1 <= p20) AND (1 <= p45))) AND (((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))))",
"processed_size": 1009,
"rewrites": 467
},
"result":
{
"edges": 892,
"markings": 506,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 640,
"problems": 128
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 34,
"adisj": 22,
"aneg": 0,
"comp": 104,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 104,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "AG((EF((((p10 <= 0) OR (p34 <= 0)) AND ((p10 <= 0) OR (p35 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p37 <= 0)) AND ((p11 <= 0) OR (p37 <= 0)) AND ((p11 <= 0) OR (p36 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)) AND ((p11 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p37 <= 0)) AND ((p9 <= 0) OR (p35 <= 0)) AND ((p9 <= 0) OR (p36 <= 0)) AND ((p13 <= 0) OR (p37 <= 0)) AND ((p13 <= 0) OR (p36 <= 0)) AND ((p13 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p12 <= 0) OR (p37 <= 0)) AND ((p12 <= 0) OR (p36 <= 0)) AND ((p12 <= 0) OR (p35 <= 0)) AND ((p12 <= 0) OR (p34 <= 0)))) OR AX(((((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p41))) AND (((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31)))))))",
"processed_size": 1660,
"rewrites": 467
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 11245908,
"markings": 1914784,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EX(((p11 <= 0) OR (p96 <= 0) OR (p87 <= 0)))",
"processed_size": 46,
"rewrites": 465
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p9 <= 0) OR (p88 <= 0))))",
"processed_size": 34,
"rewrites": 466
},
"result":
{
"edges": 989,
"markings": 670,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87)))))",
"processed_size": 513,
"rewrites": 465
},
"result":
{
"edges": 8856,
"markings": 5325,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p11 <= 0) OR (p87 <= 0))",
"processed_size": 27,
"rewrites": 467
},
"result":
{
"edges": 9019216,
"markings": 1914784,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 706
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 2,
"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": "EF(EG(EF(((1 <= p18) AND (1 <= p100)))))",
"processed_size": 40,
"rewrites": 467
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 6003,
"markings": 2669,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 883
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 13,
"aneg": 2,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AG(((((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31))) OR EF((((p0 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p14 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p18 <= 0))))))",
"processed_size": 640,
"rewrites": 466
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 11076205,
"markings": 1914784,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1170
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 34,
"adisj": 14,
"aneg": 0,
"comp": 88,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 88,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "A((AG((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31)))) OR ((((p0 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p14 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p18 <= 0))) OR (((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p90 <= 0))))) U EG((((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p96)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p10) AND (1 <= p95)) OR ((1 <= p10) AND (1 <= p96)) OR ((1 <= p10) AND (1 <= p94)) OR ((1 <= p10) AND (1 <= p97)) OR ((1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p19) AND (1 <= p28)))))",
"processed_size": 1402,
"rewrites": 467
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 787,
"markings": 492,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1756
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 140,
"adisj": 44,
"aneg": 1,
"comp": 376,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 376,
"taut": 0,
"tconj": 1,
"tdisj": 28,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 74,
"visible_transitions": 0
},
"processed": "(E(EF((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68)))) U (((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87)))) AND (EF((((p15 <= 0) OR (p98 <= 0)) AND ((p14 <= 0) OR (p98 <= 0)) AND ((p16 <= 0) OR (p99 <= 0)) AND ((p18 <= 0) OR (p100 <= 0)) AND ((p19 <= 0) OR (p100 <= 0)) AND ((p20 <= 0) OR (p101 <= 0)) AND ((p21 <= 0) OR (p101 <= 0)) AND ((p17 <= 0) OR (p99 <= 0)))) OR ((((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0))) OR ((((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p25 <= 0)) AND ((p8 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p4 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p25 <= 0))) OR (((1 <= p15) AND (1 <= p98)) OR (((1 <= p14) AND (1 <= p98)) OR (((1 <= p16) AND (1 <= p99)) OR (((1 <= p18) AND (1 <= p100)) OR (((1 <= p19) AND (1 <= p100)) OR (((1 <= p20) AND (1 <= p101)) OR (((1 <= p21) AND (1 <= p101)) OR (((1 <= p17) AND (1 <= p99)) OR (((1 <= p10) AND (1 <= p35)) OR (((1 <= p10) AND (1 <= p36)) OR (((1 <= p10) AND (1 <= p37)) OR (((1 <= p11) AND (1 <= p37)) OR (((1 <= p11) AND (1 <= p36)) OR (((1 <= p11) AND (1 <= p34)) OR (((1 <= p9) AND (1 <= p34)) OR (((1 <= p9) AND (1 <= p37)) OR (((1 <= p9) AND (1 <= p35)) OR (((1 <= p9) AND (1 <= p36)) OR (((1 <= p13) AND (1 <= p36)) OR (((1 <= p13) AND (1 <= p35)) OR (((1 <= p13) AND (1 <= p34)) OR (((1 <= p12) AND (1 <= p37)) OR (((1 <= p12) AND (1 <= p35)) OR (((1 <= p12) AND (1 <= p34)) OR (((((1 <= p0) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p14)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p18))) AND (((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p96)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p10) AND (1 <= p95)) OR ((1 <= p10) AND (1 <= p96)) OR ((1 <= p10) AND (1 <= p94)) OR ((1 <= p10) AND (1 <= p97))) AND (((1 <= p11) AND (1 <= p87)) OR ((1 <= p13) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p86)) OR ((1 <= p12) AND (1 <= p88)) OR ((1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p19) AND (1 <= p28)))) OR ((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))) AND (((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p41)))))))))))))))))))))))))))))))))",
"processed_size": 5994,
"rewrites": 467
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 46089,
"markings": 9960,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3512
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 12,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)))",
"processed_size": 369,
"rewrites": 485
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 12,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)))",
"processed_size": 369,
"rewrites": 485
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87)))))",
"processed_size": 513,
"rewrites": 465
},
"result":
{
"edges": 8856,
"markings": 5325,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 155564,
"runtime": 58.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(A(G(**)))) : E(F(**)) : A(G((E(F(**)) OR A(X(**))))) : (E((E(F(**)) U **)) AND (E(F(*)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))))))))))))))))))))) : (E(F(**)) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))) : A(((A(G(**)) OR (** OR **)) U E(G(**)))) : A(G((* OR E(F(*))))) : E(F(E(G(E(F(**)))))) : A(G(*)) : E(X(*)) : A(G(E(F(**))))"
},
"net":
{
"arcs": 768,
"conflict_clusters": 7,
"places": 102,
"places_significant": 76,
"singleton_clusters": 0,
"transitions": 180
},
"result":
{
"preliminary_value": "no yes yes yes yes no yes yes no yes yes ",
"value": "no yes yes yes yes no yes yes no yes yes "
},
"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: 282/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 180 transitions, 76 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 CTLFireability.xml
lola: A (X (A (G (((((p14 <= 0) OR (p42 <= 0)) AND ((p18 <= 0) OR (p44 <= 0)) AND ((p15 <= 0) OR (p42 <= 0)) AND ((p16 <= 0) OR (p43 <= 0)) AND ((p21 <= 0) OR (p45 <= 0)) AND ((p17 <= 0) OR (p43 <= 0)) AND ((p19 <= 0) OR (p44 <= 0)) AND ((p20 <= 0) OR (p45 <= 0))) OR (((p18 <= 0) OR (p56 <= 0) OR (p67 <= 0)) AND ((p18 <= 0) OR (p64 <= 0) OR (p69 <= 0)) AND ((p16 <= 0) OR (p63 <= 0) OR (p69 <= 0)) AND ((p16 <= 0) OR (p59 <= 0) OR (p68 <= 0)) AND ((p16 <= 0) OR (p55 <= 0) OR (p67 <= 0)) AND ((p18 <= 0) OR (p52 <= 0) OR (p66 <= 0)) AND ((p20 <= 0) OR (p61 <= 0) OR (p68 <= 0)) AND ((p20 <= 0) OR (p53 <= 0) OR (p66 <= 0)) AND ((p20 <= 0) OR (p57 <= 0) OR (p67 <= 0)) AND ((p20 <= 0) OR (p65 <= 0) OR (p69 <= 0)) AND ((p14 <= 0) OR (p54 <= 0) OR (p67 <= 0)) AND ((p14 <= 0) OR (p58 <= 0) OR (p68 <= 0)) AND ((p14 <= 0) OR (p50 <= 0) OR (p66 <= 0)) AND ((p14 <= 0) OR (p62 <= 0) OR (p69 <= 0)) AND ((p16 <= 0) OR (p51 <= 0) OR (p66 <= 0)) AND ((p18 <= 0) OR (p60 <= 0) OR (p68 <= 0)))))))) : E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87))))) : A (G ((E (F ((((p10 <= 0) OR (p34 <= 0)) AND ((p10 <= 0) OR (p35 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p37 <= 0)) AND ((p11 <= 0) OR (p37 <= 0)) AND ((p11 <= 0) OR (p36 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)) AND ((p11 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p37 <= 0)) AND ((p9 <= 0) OR (p35 <= 0)) AND ((p9 <= 0) OR (p36 <= 0)) AND ((p13 <= 0) OR (p37 <= 0)) AND ((p13 <= 0) OR (p36 <= 0)) AND ((p13 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p12 <= 0) OR (p37 <= 0)) AND ((p12 <= 0) OR (p36 <= 0)) AND ((p12 <= 0) OR (p35 <= 0)) AND ((p12 <= 0) OR (p34 <= 0))))) OR A (X (((((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p41))) AND (((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31))))))))) : (E ((E (F ((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))))) U (((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87))))) AND ((((((((((((((((((((((((((((NOT(A (G ((((1 <= p15) AND (1 <= p98)) OR ((1 <= p14) AND (1 <= p98)) OR ((1 <= p16) AND (1 <= p99)) OR ((1 <= p18) AND (1 <= p100)) OR ((1 <= p19) AND (1 <= p100)) OR ((1 <= p20) AND (1 <= p101)) OR ((1 <= p21) AND (1 <= p101)) OR ((1 <= p17) AND (1 <= p99)))))) OR (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0)))) OR (((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p25 <= 0)) AND ((p8 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p4 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p25 <= 0)))) OR ((1 <= p15) AND (1 <= p98))) OR ((1 <= p14) AND (1 <= p98))) OR ((1 <= p16) AND (1 <= p99))) OR ((1 <= p18) AND (1 <= p100))) OR ((1 <= p19) AND (1 <= p100))) OR ((1 <= p20) AND (1 <= p101))) OR ((1 <= p21) AND (1 <= p101))) OR ((1 <= p17) AND (1 <= p99))) OR ((1 <= p10) AND (1 <= p35))) OR ((1 <= p10) AND (1 <= p36))) OR ((1 <= p10) AND (1 <= p37))) OR ((1 <= p11) AND (1 <= p37))) OR ((1 <= p11) AND (1 <= p36))) OR ((1 <= p11) AND (1 <= p34))) OR ((1 <= p9) AND (1 <= p34))) OR ((1 <= p9) AND (1 <= p37))) OR ((1 <= p9) AND (1 <= p35))) OR ((1 <= p9) AND (1 <= p36))) OR ((1 <= p13) AND (1 <= p36))) OR ((1 <= p13) AND (1 <= p35))) OR ((1 <= p13) AND (1 <= p34))) OR ((1 <= p12) AND (1 <= p37))) OR ((1 <= p12) AND (1 <= p35))) OR ((1 <= p12) AND (1 <= p34))) OR ((((1 <= p0) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p14)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p18))) AND (((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p96)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p10) AND (1 <= p95)) OR ((1 <= p10) AND (1 <= p96)) OR ((1 <= p10) AND (1 <= p94)) OR ((1 <= p10) AND (1 <= p97))) AND (((1 <= p11) AND (1 <= p87)) OR ((1 <= p13) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p86)) OR ((1 <= p12) AND (1 <= p88)) OR ((1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p19) AND (1 <= p28))))) OR ((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))) AND (((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p41)))))) : ((((((((((((E (F (E ((((1 <= p47) OR (1 <= p46) OR (1 <= p49) OR (1 <= p48)) U (((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87))))))) AND ((p6 <= 0) OR (p41 <= 0))) AND ((p8 <= 0) OR (p38 <= 0))) AND ((p8 <= 0) OR (p39 <= 0))) AND ((p6 <= 0) OR (p38 <= 0))) AND ((p8 <= 0) OR (p40 <= 0))) AND ((p6 <= 0) OR (p40 <= 0))) AND ((p7 <= 0) OR (p38 <= 0))) AND ((p7 <= 0) OR (p39 <= 0))) AND ((p5 <= 0) OR (p40 <= 0))) AND ((p5 <= 0) OR (p41 <= 0))) AND ((p5 <= 0) OR (p39 <= 0))) AND ((p7 <= 0) OR (p41 <= 0))) : A ((((A (G ((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31))))) OR (((p0 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p14 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)))) OR (((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p90 <= 0)))) U E (G ((((1 <= p12) AND (1 <= p97)) OR ((1 <= p12) AND (1 <= p95)) OR ((1 <= p12) AND (1 <= p96)) OR ((1 <= p12) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p11) AND (1 <= p95)) OR ((1 <= p11) AND (1 <= p96)) OR ((1 <= p11) AND (1 <= p97)) OR ((1 <= p13) AND (1 <= p94)) OR ((1 <= p13) AND (1 <= p95)) OR ((1 <= p13) AND (1 <= p96)) OR ((1 <= p13) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p94)) OR ((1 <= p9) AND (1 <= p95)) OR ((1 <= p9) AND (1 <= p96)) OR ((1 <= p9) AND (1 <= p97)) OR ((1 <= p10) AND (1 <= p95)) OR ((1 <= p10) AND (1 <= p96)) OR ((1 <= p10) AND (1 <= p94)) OR ((1 <= p10) AND (1 <= p97)) OR ((1 <= p20) AND (1 <= p29)) OR ((1 <= p15) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p26)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p28)) OR ((1 <= p19) AND (1 <= p28))))))) : NOT(E (F (((((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0))) AND A (G ((((1 <= p0) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p14)) OR ((1 <= p3) AND (1 <= p21)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p17)) OR ((1 <= p2) AND (1 <= p18))))))))) : E (F (E (G (E (F (((1 <= p18) AND (1 <= p100)))))))) : NOT(E (F (((1 <= p9) AND (1 <= p88))))) : NOT(A (X (((1 <= p11) AND (1 <= p96) AND (1 <= p87))))) : A (G (E (((0 <= 0) U ((p11 <= 0) OR (p87 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((((p14 <= 0) OR (p42 <= 0)) AND ((p18 <= 0) OR (p44 <= 0)) AND ((p15 <= 0) OR (p42 <= 0)) AND ((p16 <= 0) OR (p43 <= 0)) AND ((p21 <= 0) OR (p45 <= 0)) AND ((p17 <= 0) OR (p43 <= 0)) AND ((p19 <= 0) OR (p44 <= 0)) AND ((p20 <= 0) OR (p45 <= 0))) OR (((p18 <= 0) OR (p56 <= 0) OR (p67 <= 0)) AND ((p18 <= 0) OR (p64 <= 0) OR (p69 <= 0)) AND ((p16 <= 0) OR (p63 <= 0) OR (p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)) OR ((1 <= p20) AND (1 <= p45))) AND (((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ... (shortened)
lola: processed formula length: 1009
lola: 467 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)) OR ((1 <= p20) AND (1 <= p45))) AND (((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 640 literals and 128 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 506 markings, 892 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((((p10 <= 0) OR (p34 <= 0)) AND ((p10 <= 0) OR (p35 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p37 <= 0)) AND ((p11 <= 0) OR (p37 <= 0)) AND ((p11 <= 0) OR (p36 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)) AND ((p11 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p37 <= 0)) AND ((p9 <= 0) OR (p35 <= 0)) AND ((p9 <= 0) OR (p36 <= 0)) AND ((p13 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((((p10 <= 0) OR (p34 <= 0)) AND ((p10 <= 0) OR (p35 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p37 <= 0)) AND ((p11 <= 0) OR (p37 <= 0)) AND ((p11 <= 0) OR (p36 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)) AND ((p11 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p34 <= 0)) AND ((p9 <= 0) OR (p37 <= 0)) AND ((p9 <= 0) OR (p35 <= 0)) AND ((p9 <= 0) OR (p36 <= 0)) AND ((p13 <= 0) ... (shortened)
lola: processed formula length: 1660
lola: 467 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 913407 markings, 4958848 edges, 182681 markings/sec, 0 secs
lola: 1559991 markings, 8973473 edges, 129317 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1914784 markings, 11245908 edges
lola: ========================================
lola: subprocess 2 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p11 <= 0) OR (p96 <= 0) OR (p87 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p11 <= 0) OR (p96 <= 0) OR (p87 <= 0)))
lola: processed formula length: 46
lola: 465 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p9 <= 0) OR (p88 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p9 <= 0) OR (p88 <= 0))))
lola: processed formula length: 34
lola: 466 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 670 markings, 989 edges
lola: ========================================
lola: subprocess 4 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) ... (shortened)
lola: processed formula length: 513
lola: 465 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5325 markings, 8856 edges
lola: ========================================
lola: subprocess 5 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p11 <= 0) OR (p87 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p11 <= 0) OR (p87 <= 0))
lola: processed formula length: 27
lola: 467 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p11 <= 0) OR (p87 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11) AND (1 <= p87))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-5-0.sara

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
lola: state equation 1: solution produced
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 13388)
lola: sara is running 0 secs || sara is running 0 secs || 781023 markings, 3232424 edges, 156205 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1166188 markings, 5350098 edges, 77033 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1616512 markings, 7428865 edges, 90065 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1914784 markings, 9019216 edges
lola: ========================================
lola: subprocess 6 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (E (F (((1 <= p18) AND (1 <= p100))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(EG(EF(((1 <= p18) AND (1 <= p100)))))
lola: processed formula length: 40
lola: 467 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2669 markings, 6003 edges
lola: ========================================
lola: subprocess 7 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31))) OR E (F (((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31))) OR EF((((p0 <=... (shortened)
lola: processed formula length: 640
lola: 466 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 652281 markings, 3293569 edges, 130456 markings/sec, 0 secs
lola: 1078055 markings, 6037805 edges, 85155 markings/sec, 5 secs
lola: 1541739 markings, 8803897 edges, 92737 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1914784 markings, 11076205 edges
lola: ========================================
lola: subprocess 8 will run for 1170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((A (G ((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31))))) OR ((((p0 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p14 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p18 <= 0))) OR (((p9 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((AG((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31)))) OR ((((p0 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p14 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p17 <= 0)) AND ((p2 <= 0) OR (p18 <= 0))) OR (((p9 <= 0) OR (p... (shortened)
lola: processed formula length: 1402
lola: 467 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 492 markings, 787 edges
lola: ========================================
lola: subprocess 9 will run for 1756 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((E (F ((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: (E(EF((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (... (shortened)
lola: processed formula length: 5994
lola: 467 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9960 markings, 46089 edges
lola: subprocess 10 will run for 3512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p6 <= 0) OR (p41 <= 0)) AND (((p8 <= 0) OR (p38 <= 0)) AND (((p8 <= 0) OR (p39 <= 0)) AND (((p6 <= 0) OR (p38 <= 0)) AND (((p8 <= 0) OR (p40 <= 0)) AND (((p6 <= 0) OR (p40 <= 0)) AND (((p7 <= 0) OR (p38 <= 0)) AND (((p7 <= 0) OR (p39 <= 0)) AND (((p5 <= 0) OR (p40 <= 0)) AND (((p5 <= 0) OR (p41 <= 0)) AND (((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)))
lola: processed formula length: 369
lola: 485 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 24 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
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: ...considering subproblem: (E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p6 <= 0) OR (p41 <= 0)) AND (((p8 <= 0) OR (p38 <= 0)) AND (((p8 <= 0) OR (p39 <= 0)) AND (((p6 <= 0) OR (p38 <= 0)) AND (((p8 <= 0) OR (p40 <= 0)) AND (((p6 <= 0) OR (p40 <= 0)) AND (((p7 <= 0) OR (p38 <= 0)) AND (((p7 <= 0) OR (p39 <= 0)) AND (((p5 <= 0) OR (p40 <= 0)) AND (((p5 <= 0) OR (p41 <= 0)) AND (((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)))
lola: processed formula length: 369
lola: 485 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 24 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) ... (shortened)
lola: processed formula length: 513
lola: 465 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5325 markings, 8856 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes yes no yes yes
lola:
preliminary result: no yes yes yes yes no yes yes no yes yes
lola: memory consumption: 155564 KB
lola: time consumption: 58 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 5337796 kB
After kill :
MemTotal: 16427332 kB
MemFree: 5336660 kB

--------------------
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="LamportFastMutEx-PT-4"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is LamportFastMutEx-PT-4, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928900660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;