Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 562K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 612K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K Mar 27 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Mar 27 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 47K Mar 25 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 154K Mar 25 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 927K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-5-00
FORMULA_NAME Peterson-PT-5-01
FORMULA_NAME Peterson-PT-5-02
FORMULA_NAME Peterson-PT-5-03
FORMULA_NAME Peterson-PT-5-04
FORMULA_NAME Peterson-PT-5-05
FORMULA_NAME Peterson-PT-5-06
FORMULA_NAME Peterson-PT-5-07
FORMULA_NAME Peterson-PT-5-08
FORMULA_NAME Peterson-PT-5-09
FORMULA_NAME Peterson-PT-5-10
FORMULA_NAME Peterson-PT-5-11
FORMULA_NAME Peterson-PT-5-12
FORMULA_NAME Peterson-PT-5-13
FORMULA_NAME Peterson-PT-5-14
FORMULA_NAME Peterson-PT-5-15

=== Now, execution of the tool begins

BK_START 1621026664139

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 21:11:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 21:11:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 21:11:05] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2021-05-14 21:11:05] [INFO ] Transformed 834 places.
[2021-05-14 21:11:05] [INFO ] Transformed 1242 transitions.
[2021-05-14 21:11:05] [INFO ] Found NUPN structural information;
[2021-05-14 21:11:05] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 707 ms. (steps per millisecond=141 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0]
[2021-05-14 21:11:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2021-05-14 21:11:06] [INFO ] Computed 23 place invariants in 25 ms
[2021-05-14 21:11:06] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned unsat
[2021-05-14 21:11:07] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned unsat
[2021-05-14 21:11:07] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned unsat
[2021-05-14 21:11:07] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2021-05-14 21:11:07] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 33 ms returned sat
[2021-05-14 21:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:11:08] [INFO ] [Real]Absence check using state equation in 1509 ms returned sat
[2021-05-14 21:11:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:11:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 92 ms returned sat
[2021-05-14 21:11:09] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:11:10] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2021-05-14 21:11:10] [INFO ] State equation strengthened by 230 read => feed constraints.
[2021-05-14 21:11:10] [INFO ] [Nat]Added 230 Read/Feed constraints in 48 ms returned sat
[2021-05-14 21:11:10] [INFO ] Deduced a trap composed of 28 places in 402 ms
[2021-05-14 21:11:11] [INFO ] Deduced a trap composed of 28 places in 327 ms
[2021-05-14 21:11:11] [INFO ] Deduced a trap composed of 28 places in 343 ms
[2021-05-14 21:11:12] [INFO ] Deduced a trap composed of 15 places in 336 ms
[2021-05-14 21:11:12] [INFO ] Deduced a trap composed of 11 places in 335 ms
[2021-05-14 21:11:12] [INFO ] Deduced a trap composed of 15 places in 314 ms
[2021-05-14 21:11:13] [INFO ] Deduced a trap composed of 11 places in 317 ms
[2021-05-14 21:11:13] [INFO ] Deduced a trap composed of 15 places in 305 ms
[2021-05-14 21:11:13] [INFO ] Deduced a trap composed of 14 places in 318 ms
[2021-05-14 21:11:14] [INFO ] Deduced a trap composed of 32 places in 370 ms
[2021-05-14 21:11:14] [INFO ] Deduced a trap composed of 41 places in 362 ms
[2021-05-14 21:11:15] [INFO ] Deduced a trap composed of 52 places in 370 ms
[2021-05-14 21:11:15] [INFO ] Deduced a trap composed of 43 places in 389 ms
[2021-05-14 21:11:15] [INFO ] Deduced a trap composed of 91 places in 316 ms
[2021-05-14 21:11:16] [INFO ] Deduced a trap composed of 67 places in 335 ms
[2021-05-14 21:11:16] [INFO ] Deduced a trap composed of 63 places in 315 ms
[2021-05-14 21:11:16] [INFO ] Deduced a trap composed of 90 places in 317 ms
[2021-05-14 21:11:17] [INFO ] Deduced a trap composed of 67 places in 323 ms
[2021-05-14 21:11:17] [INFO ] Deduced a trap composed of 90 places in 303 ms
[2021-05-14 21:11:17] [INFO ] Deduced a trap composed of 104 places in 258 ms
[2021-05-14 21:11:18] [INFO ] Deduced a trap composed of 93 places in 260 ms
[2021-05-14 21:11:18] [INFO ] Deduced a trap composed of 119 places in 256 ms
[2021-05-14 21:11:18] [INFO ] Deduced a trap composed of 93 places in 179 ms
[2021-05-14 21:11:18] [INFO ] Deduced a trap composed of 104 places in 178 ms
[2021-05-14 21:11:19] [INFO ] Deduced a trap composed of 93 places in 169 ms
[2021-05-14 21:11:19] [INFO ] Deduced a trap composed of 92 places in 178 ms
[2021-05-14 21:11:19] [INFO ] Deduced a trap composed of 131 places in 146 ms
[2021-05-14 21:11:19] [INFO ] Deduced a trap composed of 130 places in 139 ms
[2021-05-14 21:11:19] [INFO ] Deduced a trap composed of 130 places in 141 ms
[2021-05-14 21:11:20] [INFO ] Deduced a trap composed of 130 places in 141 ms
[2021-05-14 21:11:20] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 9687 ms
[2021-05-14 21:11:20] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 78 ms.
[2021-05-14 21:11:28] [INFO ] Added : 795 causal constraints over 159 iterations in 8737 ms. Result :unknown
[2021-05-14 21:11:29] [INFO ] [Real]Absence check using 17 positive place invariants in 40 ms returned sat
[2021-05-14 21:11:29] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:11:30] [INFO ] [Real]Absence check using state equation in 1443 ms returned sat
[2021-05-14 21:11:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:11:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 81 ms returned sat
[2021-05-14 21:11:30] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:11:32] [INFO ] [Nat]Absence check using state equation in 1371 ms returned sat
[2021-05-14 21:11:32] [INFO ] [Nat]Added 230 Read/Feed constraints in 54 ms returned sat
[2021-05-14 21:11:32] [INFO ] Deduced a trap composed of 107 places in 247 ms
[2021-05-14 21:11:32] [INFO ] Deduced a trap composed of 107 places in 247 ms
[2021-05-14 21:11:32] [INFO ] Deduced a trap composed of 57 places in 249 ms
[2021-05-14 21:11:33] [INFO ] Deduced a trap composed of 57 places in 251 ms
[2021-05-14 21:11:33] [INFO ] Deduced a trap composed of 84 places in 247 ms
[2021-05-14 21:11:33] [INFO ] Deduced a trap composed of 42 places in 246 ms
[2021-05-14 21:11:34] [INFO ] Deduced a trap composed of 115 places in 247 ms
[2021-05-14 21:11:34] [INFO ] Deduced a trap composed of 41 places in 248 ms
[2021-05-14 21:11:34] [INFO ] Deduced a trap composed of 41 places in 247 ms
[2021-05-14 21:11:34] [INFO ] Deduced a trap composed of 82 places in 243 ms
[2021-05-14 21:11:35] [INFO ] Deduced a trap composed of 15 places in 249 ms
[2021-05-14 21:11:35] [INFO ] Deduced a trap composed of 42 places in 249 ms
[2021-05-14 21:11:35] [INFO ] Deduced a trap composed of 123 places in 251 ms
[2021-05-14 21:11:36] [INFO ] Deduced a trap composed of 82 places in 246 ms
[2021-05-14 21:11:36] [INFO ] Deduced a trap composed of 57 places in 243 ms
[2021-05-14 21:11:36] [INFO ] Deduced a trap composed of 82 places in 242 ms
[2021-05-14 21:11:36] [INFO ] Deduced a trap composed of 123 places in 246 ms
[2021-05-14 21:11:37] [INFO ] Deduced a trap composed of 67 places in 250 ms
[2021-05-14 21:11:37] [INFO ] Deduced a trap composed of 57 places in 250 ms
[2021-05-14 21:11:37] [INFO ] Deduced a trap composed of 79 places in 255 ms
[2021-05-14 21:11:38] [INFO ] Deduced a trap composed of 18 places in 264 ms
[2021-05-14 21:11:38] [INFO ] Deduced a trap composed of 15 places in 248 ms
[2021-05-14 21:11:38] [INFO ] Deduced a trap composed of 105 places in 194 ms
[2021-05-14 21:11:38] [INFO ] Deduced a trap composed of 96 places in 197 ms
[2021-05-14 21:11:39] [INFO ] Deduced a trap composed of 104 places in 198 ms
[2021-05-14 21:11:39] [INFO ] Deduced a trap composed of 82 places in 199 ms
[2021-05-14 21:11:39] [INFO ] Deduced a trap composed of 63 places in 251 ms
[2021-05-14 21:11:39] [INFO ] Deduced a trap composed of 56 places in 264 ms
[2021-05-14 21:11:40] [INFO ] Deduced a trap composed of 15 places in 263 ms
[2021-05-14 21:11:40] [INFO ] Deduced a trap composed of 14 places in 262 ms
[2021-05-14 21:11:40] [INFO ] Deduced a trap composed of 15 places in 265 ms
[2021-05-14 21:11:41] [INFO ] Deduced a trap composed of 75 places in 231 ms
[2021-05-14 21:11:41] [INFO ] Deduced a trap composed of 56 places in 228 ms
[2021-05-14 21:11:41] [INFO ] Deduced a trap composed of 75 places in 228 ms
[2021-05-14 21:11:41] [INFO ] Deduced a trap composed of 76 places in 228 ms
[2021-05-14 21:11:42] [INFO ] Deduced a trap composed of 78 places in 198 ms
[2021-05-14 21:11:42] [INFO ] Deduced a trap composed of 26 places in 240 ms
[2021-05-14 21:11:42] [INFO ] Deduced a trap composed of 104 places in 147 ms
[2021-05-14 21:11:42] [INFO ] Deduced a trap composed of 108 places in 148 ms
[2021-05-14 21:11:43] [INFO ] Deduced a trap composed of 104 places in 148 ms
[2021-05-14 21:11:43] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 10946 ms
[2021-05-14 21:11:43] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 61 ms.
[2021-05-14 21:11:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t719 0) (and (or (and (> t427 0) (< o427 o719)) (and (> t432 0) (< o432 o719)) (and (> t437 0) (< o437 o719)) (and (> t447 0) (< o447 o719)) (and (> t450 0) (< o450 o719)) (and (> t807 0) (< o807 o719)) (and (> t811 0) (< o811 o719)) (and (> t817 0) (< o817 o719)) (and (> t820 0) (< o820 o719)) (and (> t852 0) (< o852 o719)) (and (> t858 0) (< o858 o719))) (or (and (> t807 0) (< o807 o719)) (and (> t811 0) (< o811 o719)) (and (> t820 0) (< o820 o719)) (and (> t852 0) (< o852 o719)) (and (> t858 0) (< o858 o719)))))") while checking expression at index 4
[2021-05-14 21:11:50] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned sat
[2021-05-14 21:11:50] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:11:52] [INFO ] [Real]Absence check using state equation in 1380 ms returned sat
[2021-05-14 21:11:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:11:52] [INFO ] [Nat]Absence check using 17 positive place invariants in 83 ms returned sat
[2021-05-14 21:11:52] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:11:53] [INFO ] [Nat]Absence check using state equation in 1309 ms returned sat
[2021-05-14 21:11:53] [INFO ] [Nat]Added 230 Read/Feed constraints in 57 ms returned sat
[2021-05-14 21:11:53] [INFO ] Deduced a trap composed of 13 places in 295 ms
[2021-05-14 21:11:54] [INFO ] Deduced a trap composed of 11 places in 297 ms
[2021-05-14 21:11:54] [INFO ] Deduced a trap composed of 13 places in 296 ms
[2021-05-14 21:11:54] [INFO ] Deduced a trap composed of 13 places in 296 ms
[2021-05-14 21:11:55] [INFO ] Deduced a trap composed of 13 places in 300 ms
[2021-05-14 21:11:55] [INFO ] Deduced a trap composed of 18 places in 299 ms
[2021-05-14 21:11:55] [INFO ] Deduced a trap composed of 122 places in 231 ms
[2021-05-14 21:11:56] [INFO ] Deduced a trap composed of 76 places in 231 ms
[2021-05-14 21:11:56] [INFO ] Deduced a trap composed of 170 places in 242 ms
[2021-05-14 21:11:56] [INFO ] Deduced a trap composed of 52 places in 233 ms
[2021-05-14 21:11:56] [INFO ] Deduced a trap composed of 101 places in 231 ms
[2021-05-14 21:11:57] [INFO ] Deduced a trap composed of 96 places in 235 ms
[2021-05-14 21:11:57] [INFO ] Deduced a trap composed of 52 places in 234 ms
[2021-05-14 21:11:57] [INFO ] Deduced a trap composed of 122 places in 233 ms
[2021-05-14 21:11:58] [INFO ] Deduced a trap composed of 186 places in 235 ms
[2021-05-14 21:11:58] [INFO ] Deduced a trap composed of 186 places in 230 ms
[2021-05-14 21:11:58] [INFO ] Deduced a trap composed of 52 places in 317 ms
[2021-05-14 21:11:58] [INFO ] Deduced a trap composed of 83 places in 236 ms
[2021-05-14 21:11:59] [INFO ] Deduced a trap composed of 71 places in 216 ms
[2021-05-14 21:11:59] [INFO ] Deduced a trap composed of 97 places in 216 ms
[2021-05-14 21:11:59] [INFO ] Deduced a trap composed of 71 places in 212 ms
[2021-05-14 21:11:59] [INFO ] Deduced a trap composed of 70 places in 218 ms
[2021-05-14 21:12:00] [INFO ] Deduced a trap composed of 71 places in 224 ms
[2021-05-14 21:12:00] [INFO ] Deduced a trap composed of 14 places in 274 ms
[2021-05-14 21:12:00] [INFO ] Deduced a trap composed of 108 places in 151 ms
[2021-05-14 21:12:00] [INFO ] Deduced a trap composed of 108 places in 149 ms
[2021-05-14 21:12:00] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7301 ms
[2021-05-14 21:12:01] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 55 ms.
[2021-05-14 21:12:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t985 0) (and (and (> t26 0) (< o26 o985)) (or (and (> t963 0) (< o963 o985)) (and (> t969 0) (< o969 o985)) (and (> t975 0) (< o975 o985)) (and (> t980 0) (< o980 o985)) (and (> t992 0) (< o992 o985)))))") while checking expression at index 5
[2021-05-14 21:12:12] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2021-05-14 21:12:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 21:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:12:13] [INFO ] [Real]Absence check using state equation in 1399 ms returned sat
[2021-05-14 21:12:13] [INFO ] [Real]Added 230 Read/Feed constraints in 26 ms returned sat
[2021-05-14 21:12:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:12:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 83 ms returned sat
[2021-05-14 21:12:13] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:12:15] [INFO ] [Nat]Absence check using state equation in 1354 ms returned sat
[2021-05-14 21:12:15] [INFO ] [Nat]Added 230 Read/Feed constraints in 57 ms returned sat
[2021-05-14 21:12:15] [INFO ] Deduced a trap composed of 11 places in 324 ms
[2021-05-14 21:12:16] [INFO ] Deduced a trap composed of 32 places in 328 ms
[2021-05-14 21:12:16] [INFO ] Deduced a trap composed of 32 places in 323 ms
[2021-05-14 21:12:16] [INFO ] Deduced a trap composed of 51 places in 321 ms
[2021-05-14 21:12:17] [INFO ] Deduced a trap composed of 51 places in 321 ms
[2021-05-14 21:12:17] [INFO ] Deduced a trap composed of 51 places in 320 ms
[2021-05-14 21:12:17] [INFO ] Deduced a trap composed of 51 places in 322 ms
[2021-05-14 21:12:18] [INFO ] Deduced a trap composed of 11 places in 320 ms
[2021-05-14 21:12:18] [INFO ] Deduced a trap composed of 82 places in 320 ms
[2021-05-14 21:12:18] [INFO ] Deduced a trap composed of 84 places in 258 ms
[2021-05-14 21:12:19] [INFO ] Deduced a trap composed of 48 places in 259 ms
[2021-05-14 21:12:19] [INFO ] Deduced a trap composed of 84 places in 257 ms
[2021-05-14 21:12:19] [INFO ] Deduced a trap composed of 75 places in 255 ms
[2021-05-14 21:12:20] [INFO ] Deduced a trap composed of 76 places in 258 ms
[2021-05-14 21:12:20] [INFO ] Deduced a trap composed of 100 places in 353 ms
[2021-05-14 21:12:20] [INFO ] Deduced a trap composed of 100 places in 356 ms
[2021-05-14 21:12:21] [INFO ] Deduced a trap composed of 74 places in 352 ms
[2021-05-14 21:12:21] [INFO ] Deduced a trap composed of 75 places in 358 ms
[2021-05-14 21:12:21] [INFO ] Deduced a trap composed of 73 places in 361 ms
[2021-05-14 21:12:22] [INFO ] Deduced a trap composed of 158 places in 351 ms
[2021-05-14 21:12:22] [INFO ] Deduced a trap composed of 101 places in 337 ms
[2021-05-14 21:12:23] [INFO ] Deduced a trap composed of 114 places in 338 ms
[2021-05-14 21:12:23] [INFO ] Deduced a trap composed of 101 places in 338 ms
[2021-05-14 21:12:23] [INFO ] Deduced a trap composed of 72 places in 305 ms
[2021-05-14 21:12:24] [INFO ] Deduced a trap composed of 44 places in 321 ms
[2021-05-14 21:12:24] [INFO ] Deduced a trap composed of 74 places in 285 ms
[2021-05-14 21:12:24] [INFO ] Deduced a trap composed of 18 places in 300 ms
[2021-05-14 21:12:25] [INFO ] Deduced a trap composed of 11 places in 288 ms
[2021-05-14 21:12:25] [INFO ] Deduced a trap composed of 20 places in 303 ms
[2021-05-14 21:12:25] [INFO ] Deduced a trap composed of 11 places in 288 ms
[2021-05-14 21:12:26] [INFO ] Deduced a trap composed of 127 places in 235 ms
[2021-05-14 21:12:26] [INFO ] Deduced a trap composed of 11 places in 317 ms
[2021-05-14 21:12:26] [INFO ] Deduced a trap composed of 161 places in 245 ms
[2021-05-14 21:12:27] [INFO ] Deduced a trap composed of 103 places in 285 ms
[2021-05-14 21:12:27] [INFO ] Deduced a trap composed of 44 places in 297 ms
[2021-05-14 21:12:27] [INFO ] Deduced a trap composed of 82 places in 303 ms
[2021-05-14 21:12:28] [INFO ] Deduced a trap composed of 19 places in 283 ms
[2021-05-14 21:12:28] [INFO ] Deduced a trap composed of 26 places in 282 ms
[2021-05-14 21:12:29] [INFO ] Deduced a trap composed of 27 places in 284 ms
[2021-05-14 21:12:29] [INFO ] Deduced a trap composed of 36 places in 304 ms
[2021-05-14 21:12:29] [INFO ] Deduced a trap composed of 36 places in 303 ms
[2021-05-14 21:12:30] [INFO ] Deduced a trap composed of 30 places in 303 ms
[2021-05-14 21:12:30] [INFO ] Deduced a trap composed of 75 places in 304 ms
[2021-05-14 21:12:30] [INFO ] Deduced a trap composed of 37 places in 266 ms
[2021-05-14 21:12:31] [INFO ] Deduced a trap composed of 80 places in 254 ms
[2021-05-14 21:12:31] [INFO ] Deduced a trap composed of 56 places in 267 ms
[2021-05-14 21:12:31] [INFO ] Deduced a trap composed of 65 places in 254 ms
[2021-05-14 21:12:32] [INFO ] Deduced a trap composed of 70 places in 282 ms
[2021-05-14 21:12:32] [INFO ] Deduced a trap composed of 56 places in 293 ms
[2021-05-14 21:12:32] [INFO ] Deduced a trap composed of 28 places in 249 ms
[2021-05-14 21:12:32] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 17453 ms
[2021-05-14 21:12:32] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 59 ms.
[2021-05-14 21:12:33] [INFO ] Added : 100 causal constraints over 20 iterations in 954 ms. Result :unknown
[2021-05-14 21:12:33] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned sat
[2021-05-14 21:12:33] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:12:35] [INFO ] [Real]Absence check using state equation in 1391 ms returned sat
[2021-05-14 21:12:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:12:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned unsat
[2021-05-14 21:12:35] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned sat
[2021-05-14 21:12:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:12:36] [INFO ] [Real]Absence check using state equation in 1395 ms returned sat
[2021-05-14 21:12:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:12:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned unsat
[2021-05-14 21:12:37] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned sat
[2021-05-14 21:12:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:12:38] [INFO ] [Real]Absence check using state equation in 1401 ms returned sat
[2021-05-14 21:12:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:12:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned unsat
[2021-05-14 21:12:38] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned sat
[2021-05-14 21:12:38] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:12:40] [INFO ] [Real]Absence check using state equation in 1384 ms returned sat
[2021-05-14 21:12:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:12:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 82 ms returned sat
[2021-05-14 21:12:40] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:12:41] [INFO ] [Nat]Absence check using state equation in 1315 ms returned sat
[2021-05-14 21:12:41] [INFO ] [Nat]Added 230 Read/Feed constraints in 50 ms returned sat
[2021-05-14 21:12:42] [INFO ] Deduced a trap composed of 11 places in 307 ms
[2021-05-14 21:12:42] [INFO ] Deduced a trap composed of 11 places in 324 ms
[2021-05-14 21:12:42] [INFO ] Deduced a trap composed of 45 places in 303 ms
[2021-05-14 21:12:43] [INFO ] Deduced a trap composed of 94 places in 309 ms
[2021-05-14 21:12:43] [INFO ] Deduced a trap composed of 67 places in 307 ms
[2021-05-14 21:12:43] [INFO ] Deduced a trap composed of 139 places in 306 ms
[2021-05-14 21:12:44] [INFO ] Deduced a trap composed of 74 places in 308 ms
[2021-05-14 21:12:44] [INFO ] Deduced a trap composed of 13 places in 305 ms
[2021-05-14 21:12:44] [INFO ] Deduced a trap composed of 42 places in 307 ms
[2021-05-14 21:12:45] [INFO ] Deduced a trap composed of 33 places in 309 ms
[2021-05-14 21:12:45] [INFO ] Deduced a trap composed of 64 places in 308 ms
[2021-05-14 21:12:45] [INFO ] Deduced a trap composed of 96 places in 301 ms
[2021-05-14 21:12:46] [INFO ] Deduced a trap composed of 114 places in 302 ms
[2021-05-14 21:12:46] [INFO ] Deduced a trap composed of 57 places in 311 ms
[2021-05-14 21:12:46] [INFO ] Deduced a trap composed of 14 places in 303 ms
[2021-05-14 21:12:47] [INFO ] Deduced a trap composed of 15 places in 302 ms
[2021-05-14 21:12:47] [INFO ] Deduced a trap composed of 11 places in 308 ms
[2021-05-14 21:12:47] [INFO ] Deduced a trap composed of 56 places in 286 ms
[2021-05-14 21:12:48] [INFO ] Deduced a trap composed of 56 places in 291 ms
[2021-05-14 21:12:48] [INFO ] Deduced a trap composed of 43 places in 247 ms
[2021-05-14 21:12:48] [INFO ] Deduced a trap composed of 71 places in 247 ms
[2021-05-14 21:12:49] [INFO ] Deduced a trap composed of 43 places in 247 ms
[2021-05-14 21:12:49] [INFO ] Deduced a trap composed of 43 places in 252 ms
[2021-05-14 21:12:49] [INFO ] Deduced a trap composed of 43 places in 275 ms
[2021-05-14 21:12:50] [INFO ] Deduced a trap composed of 89 places in 193 ms
[2021-05-14 21:12:50] [INFO ] Deduced a trap composed of 58 places in 185 ms
[2021-05-14 21:12:50] [INFO ] Deduced a trap composed of 97 places in 193 ms
[2021-05-14 21:12:50] [INFO ] Deduced a trap composed of 58 places in 198 ms
[2021-05-14 21:12:50] [INFO ] Deduced a trap composed of 86 places in 193 ms
[2021-05-14 21:12:51] [INFO ] Deduced a trap composed of 28 places in 265 ms
[2021-05-14 21:12:51] [INFO ] Deduced a trap composed of 66 places in 296 ms
[2021-05-14 21:12:51] [INFO ] Deduced a trap composed of 123 places in 159 ms
[2021-05-14 21:12:51] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 9942 ms
[2021-05-14 21:12:51] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 55 ms.
[2021-05-14 21:13:00] [INFO ] Added : 775 causal constraints over 155 iterations in 8511 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-14 21:13:00] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2021-05-14 21:13:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 21:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:13:01] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2021-05-14 21:13:01] [INFO ] [Real]Added 230 Read/Feed constraints in 27 ms returned sat
[2021-05-14 21:13:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:13:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 82 ms returned sat
[2021-05-14 21:13:02] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 21:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:13:03] [INFO ] [Nat]Absence check using state equation in 1307 ms returned sat
[2021-05-14 21:13:03] [INFO ] [Nat]Added 230 Read/Feed constraints in 53 ms returned sat
[2021-05-14 21:13:03] [INFO ] Deduced a trap composed of 63 places in 387 ms
[2021-05-14 21:13:04] [INFO ] Deduced a trap composed of 13 places in 388 ms
[2021-05-14 21:13:04] [INFO ] Deduced a trap composed of 45 places in 385 ms
[2021-05-14 21:13:05] [INFO ] Deduced a trap composed of 190 places in 391 ms
[2021-05-14 21:13:05] [INFO ] Deduced a trap composed of 77 places in 386 ms
[2021-05-14 21:13:05] [INFO ] Deduced a trap composed of 13 places in 383 ms
[2021-05-14 21:13:06] [INFO ] Deduced a trap composed of 18 places in 400 ms
[2021-05-14 21:13:06] [INFO ] Deduced a trap composed of 13 places in 382 ms
[2021-05-14 21:13:07] [INFO ] Deduced a trap composed of 142 places in 447 ms
[2021-05-14 21:13:07] [INFO ] Deduced a trap composed of 32 places in 371 ms
[2021-05-14 21:13:08] [INFO ] Deduced a trap composed of 71 places in 372 ms
[2021-05-14 21:13:08] [INFO ] Deduced a trap composed of 71 places in 372 ms
[2021-05-14 21:13:08] [INFO ] Deduced a trap composed of 27 places in 430 ms
[2021-05-14 21:13:09] [INFO ] Deduced a trap composed of 45 places in 409 ms
[2021-05-14 21:13:09] [INFO ] Deduced a trap composed of 70 places in 380 ms
[2021-05-14 21:13:10] [INFO ] Deduced a trap composed of 70 places in 381 ms
[2021-05-14 21:13:10] [INFO ] Deduced a trap composed of 97 places in 384 ms
[2021-05-14 21:13:11] [INFO ] Deduced a trap composed of 101 places in 379 ms
[2021-05-14 21:13:11] [INFO ] Deduced a trap composed of 96 places in 380 ms
[2021-05-14 21:13:11] [INFO ] Deduced a trap composed of 97 places in 352 ms
[2021-05-14 21:13:12] [INFO ] Deduced a trap composed of 97 places in 342 ms
[2021-05-14 21:13:12] [INFO ] Deduced a trap composed of 82 places in 314 ms
[2021-05-14 21:13:12] [INFO ] Deduced a trap composed of 108 places in 315 ms
[2021-05-14 21:13:13] [INFO ] Deduced a trap composed of 72 places in 308 ms
[2021-05-14 21:13:13] [INFO ] Deduced a trap composed of 103 places in 306 ms
[2021-05-14 21:13:13] [INFO ] Deduced a trap composed of 46 places in 307 ms
[2021-05-14 21:13:14] [INFO ] Deduced a trap composed of 44 places in 295 ms
[2021-05-14 21:13:14] [INFO ] Deduced a trap composed of 99 places in 274 ms
[2021-05-14 21:13:14] [INFO ] Deduced a trap composed of 51 places in 260 ms
[2021-05-14 21:13:15] [INFO ] Deduced a trap composed of 82 places in 131 ms
[2021-05-14 21:13:15] [INFO ] Deduced a trap composed of 44 places in 258 ms
[2021-05-14 21:13:15] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 12009 ms
[2021-05-14 21:13:15] [INFO ] Computed and/alt/rep : 1236/4722/1116 causal constraints in 54 ms.
[2021-05-14 21:13:21] [INFO ] Added : 625 causal constraints over 125 iterations in 6454 ms. Result :(error "Failed to check-sat")
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-14 21:13:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-14 21:13:22] [INFO ] Flatten gal took : 127 ms
FORMULA Peterson-PT-5-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 21:13:22] [INFO ] Applying decomposition
[2021-05-14 21:13:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 21:13:22] [INFO ] Flatten gal took : 72 ms
[2021-05-14 21:13:22] [INFO ] Decomposing Gal with order
[2021-05-14 21:13:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:13:22] [INFO ] Removed a total of 768 redundant transitions.
[2021-05-14 21:13:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 21:13:22] [INFO ] Flatten gal took : 254 ms
[2021-05-14 21:13:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 390 labels/synchronizations in 23 ms.
[2021-05-14 21:13:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-5-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 21:13:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2021-05-14 21:13:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Peterson-PT-5 @ 3570 seconds

FORMULA Peterson-PT-5-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-5-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for LTLCardinality @ Peterson-PT-5

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 21:13:23 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 330,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 180,
"visible_transitions": 0
},
"processed": "((p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 <= 4) R X (F ((F ((5 <= p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572)) OR (1 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220)))))",
"processed_size": 2345,
"rewrites": 84
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 7,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 390,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 210,
"visible_transitions": 0
},
"processed": "X (F ((X (X (X (F ((p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p214 + p215 + p216 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p400 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 <= 0))))) OR (G ((2 <= p517 + p518 + p519 + p520 + p522 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613)) AND X (X (X (F ((p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p214 + p215 + p216 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p400 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 <= 0)))))))))",
"processed_size": 2799,
"rewrites": 84
},
"result":
{
"edges": 218,
"markings": 203,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 180,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 180,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p723 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764)))",
"processed_size": 1272,
"rewrites": 84
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 66,
"visible_transitions": 0
},
"processed": "G ((X (X (((p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 <= p517 + p518 + p519 + p520 + p522 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613)))) OR (1 <= p809 + p808 + p807 + p806 + p805 + p785)))",
"processed_size": 486,
"rewrites": 84
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 768,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 372,
"visible_transitions": 0
},
"processed": "F (G ((F (((p809 + p808 + p807 + p806 + p805 + p785 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220) AND (p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p181 + p182 + p183 + p184 + p185 + p187 + p188 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p94 + p95 + p96 + p97 + p98 + p99))) AND (X (F ((p775 + p829 + p830 + p831 + p832 + p833 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220))) OR ((p809 + p808 + p807 + p806 + p805 + p785 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220) AND (p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p181 + p182 + p183 + p184 + p185 + p187 + p188 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p94 + p95 + p96 + p97 + p98 + p99))))))",
"processed_size": 5203,
"rewrites": 84
},
"result":
{
"edges": 132,
"markings": 119,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 4,
"aneg": 3,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F ((G ((((1 <= p802)) AND ((p201 <= 0)))) OR ((((1 <= p329)) AND ((p766 <= 0))) AND (((1 <= p802)) AND ((p201 <= 0)))))) AND (((p329 <= 0)) OR ((1 <= p766)))))",
"processed_size": 164,
"rewrites": 84
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 13,
"adisj": 7,
"aneg": 4,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((((1 <= p831)) AND ((p794 <= 0))) OR (((1 <= p785)) AND ((p774 <= 0)))) R X (((((((1 <= p31)) AND ((p819 <= 0))) OR (((1 <= p613)) AND ((p399 <= 0)))) R (((p785 <= 0)) OR ((1 <= p774)))) AND G ((((1 <= p31)) AND ((p819 <= 0)))))))",
"processed_size": 235,
"rewrites": 84
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((G (F ((p809 + p808 + p807 + p806 + p805 + p785 <= 1))) OR (p809 + p808 + p807 + p806 + p805 + p785 <= 5)))",
"processed_size": 110,
"rewrites": 84
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 44812,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((G(F(*)) OR **)) : (* R X(F((F(**) OR *)))) : X(F((X(X(X(F(*)))) OR (G(**) AND X(X(X(F(*)))))))) : X(G(*)) : G((X(X(**)) OR **)) : F(G((F(**) AND (X(F(**)) OR **)))) : (X(G(**)) AND F(*)) : X((F((G(*) OR (* AND *))) AND **)) : (* R X(((* R *) AND G(*)))) : (X(F(**)) OR (X(G(**)) AND (** AND **))) : G(**) : (F(G(**)) OR X(*))"
},
"net":
{
"arcs": 3828,
"conflict_clusters": 581,
"places": 834,
"places_significant": 811,
"singleton_clusters": 0,
"transitions": 1242
},
"result":
{
"preliminary_value": "yes no no no no no no no no yes no no ",
"value": "yes no no no no no no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2076/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 834
lola: finding significant places
lola: 834 places, 1242 transitions, 811 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p824 <= 1)
lola: LP says that atomic proposition is always true: (p817 <= 1)
lola: LP says that atomic proposition is always true: (p766 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p766 <= 1)
lola: LP says that atomic proposition is always true: (p794 <= 1)
lola: LP says that atomic proposition is always true: (p774 <= 1)
lola: LP says that atomic proposition is always true: (p819 <= 1)
lola: LP says that atomic proposition is always true: (p399 <= 1)
lola: LP says that atomic proposition is always true: (p774 <= 1)
lola: LP says that atomic proposition is always true: (p819 <= 1)
lola: LP says that atomic proposition is always true: (p391 <= 1)
lola: LP says that atomic proposition is always true: (p785 <= 1)
lola: LP says that atomic proposition is always true: (p785 <= 1)
lola: LP says that atomic proposition is always true: (p785 <= 1)
lola: LP says that atomic proposition is always true: (p617 <= 1)
lola: LP says that atomic proposition is always true: (p638 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: F ((G (F (X (NOT(G ((2 <= p809 + p808 + p807 + p806 + p805 + p785)))))) OR (p809 + p808 + p807 + p806 + p805 + p785 <= 5))) : NOT(((5 <= p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572) U G (X (G ((NOT(F ((5 <= p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572))) AND (p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220 <= 0))))))) : X (F ((G ((2 <= p517 + p518 + p519 + p520 + p522 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613)) U NOT(X (X (NOT(F (NOT(X ((1 <= p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p214 + p215 + p216 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p400 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412))))))))))) : X (NOT(F ((G ((X ((1 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220)) U (0 <= 0))) AND ((p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 <= p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572) U (p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p723 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 <= 0)))))) : G ((X ((NOT(X (((0 <= 0) U (0 <= 0)))) U X (((p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 <= p517 + p518 + p519 + p520 + p522 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613))))) OR (1 <= p809 + p808 + p807 + p806 + p805 + p785))) : X (((p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p181 + p182 + p183 + p184 + p185 + p187 + p188 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p94 + p95 + p96 + p97 + p98 + p99) U F (G ((X (F ((p775 + p829 + p830 + p831 + p832 + p833 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220))) U ((p809 + p808 + p807 + p806 + p805 + p785 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220) AND (p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p521 + p523 + p524 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p181 + p182 + p183 + p184 + p185 + p187 + p188 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p94 + p95 + p96 + p97 + p98 + p99))))))) : (G (X (((1 <= p824)))) AND NOT(G ((((p403 <= 0)) OR ((1 <= p817)))))) : X ((NOT(G (((((p329 <= 0)) OR ((1 <= p766))) U (((p802 <= 0)) OR ((1 <= p201)))))) AND (((p329 <= 0)) OR ((1 <= p766))))) : NOT((((((p831 <= 0)) OR ((1 <= p794))) AND (((p785 <= 0)) OR ((1 <= p774)))) U X (((((((p31 <= 0)) OR ((1 <= p819))) AND (((p613 <= 0)) OR ((1 <= p399)))) U (((1 <= p785)) AND ((p774 <= 0)))) OR F ((((p31 <= 0)) OR ((1 <= p819)))))))) : (X (F ((((1 <= p391)) U (((p775 <= 0)) OR ((1 <= p785)))))) OR ((X (G ((((p775 <= 0)) OR ((1 <= p785))))) AND ((1 <= p775))) AND ((p785 <= 0)))) : (((1 <= 0) U (0 <= 0)) AND G ((((p536 <= 0)) OR ((1 <= p617))))) : (((1 <= 0) U F (G ((((p802 <= 0)) OR ((1 <= p638)))))) OR NOT(X ((((p487 <= 0)) OR ((1 <= p199))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 +... (shortened)
lola: processed formula length: 2345
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: ========================================
lola: subprocess 1 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (X (F ((p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p214 + p215 + p216 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (X (F ((p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p214 + p215 + p216 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p2... (shortened)
lola: processed formula length: 2799
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 17 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 203 markings, 218 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p63... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p63... (shortened)
lola: processed formula length: 1272
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 41 markings, 41 edges
lola: ========================================
lola: subprocess 3 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (((p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 <= p517 + p518 + p519 + p520 + p522 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p605 + p606 + p607 + p608 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (((p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 <= p517 + p518 + p519 + p520 + p522 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p605 + p606 + p607 + p608 + p6... (shortened)
lola: processed formula length: 486
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 41 markings, 41 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p809 + p808 + p807 + p806 + p805 + p785 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220) AND (p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p809 + p808 + p807 + p806 + p805 + p785 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p186 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p213 + p217 + p218 + p219 + p220) AND (p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p393 + p394 + p396 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 ... (shortened)
lola: processed formula length: 5203
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 119 markings, 132 edges
lola: ========================================
lola: subprocess 5 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p824)))) AND F ((((1 <= p403)) AND ((p817 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p403)) AND ((p817 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p403 <= 0)) OR ((1 <= p817)))
lola: processed formula length: 33
lola: 86 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 34 markings, 34 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((G ((((1 <= p802)) AND ((p201 <= 0)))) OR ((((1 <= p329)) AND ((p766 <= 0))) AND (((1 <= p802)) AND ((p201 <= 0)))))) AND (((p329 <= 0)) OR ((1 <= p766)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G ((((1 <= p802)) AND ((p201 <= 0)))) OR ((((1 <= p329)) AND ((p766 <= 0))) AND (((1 <= p802)) AND ((p201 <= 0)))))) AND (((p329 <= 0)) OR ((1 <= p766)))))
lola: processed formula length: 164
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 42 markings, 42 edges
lola: ========================================
lola: subprocess 7 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p831)) AND ((p794 <= 0))) OR (((1 <= p785)) AND ((p774 <= 0)))) R X (((((((1 <= p31)) AND ((p819 <= 0))) OR (((1 <= p613)) AND ((p399 <= 0)))) R (((p785 <= 0)) OR ((1 <= p774)))) AND G ((((1 <= p31)) AND ((p819 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((1 <= p831)) AND ((p794 <= 0))) OR (((1 <= p785)) AND ((p774 <= 0)))) R X (((((((1 <= p31)) AND ((p819 <= 0))) OR (((1 <= p613)) AND ((p399 <= 0)))) R (((p785 <= 0)) OR ((1 <= p774)))) AND G ((((1 <= p31)) AND ((p819 <= 0)))))))
lola: processed formula length: 235
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 41 markings, 41 edges
lola: ========================================
lola: subprocess 8 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((p775 <= 0)) OR ((1 <= p785))))) OR (X (G ((((p775 <= 0)) OR ((1 <= p785))))) AND (((1 <= p775)) AND ((p785 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p775)) AND ((p785 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p775)) AND ((p785 <= 0)))
lola: processed formula length: 33
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p775 <= 0)) OR ((1 <= p785)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p775 <= 0)) OR ((1 <= p785)))))
lola: processed formula length: 41
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p802 <= 0)) OR ((1 <= p638))))) OR X ((((1 <= p487)) AND ((p199 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p802 <= 0)) OR ((1 <= p638)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p802 <= 0)) OR ((1 <= p638)))))
lola: processed formula length: 41
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 78 markings, 86 edges
lola: ========================================
lola: subprocess 10 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p487)) AND ((p199 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p487)) AND ((p199 <= 0))))
lola: processed formula length: 37
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 41 markings, 41 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p536 <= 0)) OR ((1 <= p617))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p536 <= 0)) OR ((1 <= p617))))
lola: processed formula length: 37
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 219 markings, 236 edges
lola: ========================================
lola: subprocess 11 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((p809 + p808 + p807 + p806 + p805 + p785 <= 1))) OR (p809 + p808 + p807 + p806 + p805 + p785 <= 5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((p809 + p808 + p807 + p806 + p805 + p785 <= 1))) OR (p809 + p808 + p807 + p806 + p805 + p785 <= 5)))
lola: processed formula length: 110
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 12 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no no yes no no
lola:
preliminary result: yes no no no no no no no no yes no no
lola: memory consumption: 44812 KB
lola: time consumption: 9 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is Peterson-PT-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-tall-162089151400313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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