Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000193.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 104K 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 BusinessProcesses-PT-09-00
FORMULA_NAME BusinessProcesses-PT-09-01
FORMULA_NAME BusinessProcesses-PT-09-02
FORMULA_NAME BusinessProcesses-PT-09-03
FORMULA_NAME BusinessProcesses-PT-09-04
FORMULA_NAME BusinessProcesses-PT-09-05
FORMULA_NAME BusinessProcesses-PT-09-06
FORMULA_NAME BusinessProcesses-PT-09-07
FORMULA_NAME BusinessProcesses-PT-09-08
FORMULA_NAME BusinessProcesses-PT-09-09
FORMULA_NAME BusinessProcesses-PT-09-10
FORMULA_NAME BusinessProcesses-PT-09-11
FORMULA_NAME BusinessProcesses-PT-09-12
FORMULA_NAME BusinessProcesses-PT-09-13
FORMULA_NAME BusinessProcesses-PT-09-14
FORMULA_NAME BusinessProcesses-PT-09-15

=== Now, execution of the tool begins

BK_START 1620936787586

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:13:09] [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-13 20:13:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:13:09] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-13 20:13:09] [INFO ] Transformed 403 places.
[2021-05-13 20:13:09] [INFO ] Transformed 374 transitions.
[2021-05-13 20:13:09] [INFO ] Found NUPN structural information;
[2021-05-13 20:13:09] [INFO ] Parsed PT model containing 403 places and 374 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1052 resets, run finished after 243 ms. (steps per millisecond=411 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1]
// Phase 1: matrix 374 rows 403 cols
[2021-05-13 20:13:09] [INFO ] Computed 65 place invariants in 20 ms
[2021-05-13 20:13:09] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2021-05-13 20:13:09] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-13 20:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:10] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2021-05-13 20:13:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:13:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned unsat
[2021-05-13 20:13:10] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2021-05-13 20:13:10] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 19 ms returned sat
[2021-05-13 20:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:10] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2021-05-13 20:13:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:13:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 31 ms returned sat
[2021-05-13 20:13:11] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-13 20:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:11] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2021-05-13 20:13:11] [INFO ] Deduced a trap composed of 12 places in 223 ms
[2021-05-13 20:13:11] [INFO ] Deduced a trap composed of 14 places in 157 ms
[2021-05-13 20:13:12] [INFO ] Deduced a trap composed of 12 places in 144 ms
[2021-05-13 20:13:12] [INFO ] Deduced a trap composed of 8 places in 177 ms
[2021-05-13 20:13:12] [INFO ] Deduced a trap composed of 12 places in 168 ms
[2021-05-13 20:13:12] [INFO ] Deduced a trap composed of 25 places in 187 ms
[2021-05-13 20:13:12] [INFO ] Deduced a trap composed of 16 places in 92 ms
[2021-05-13 20:13:12] [INFO ] Deduced a trap composed of 17 places in 81 ms
[2021-05-13 20:13:12] [INFO ] Deduced a trap composed of 33 places in 91 ms
[2021-05-13 20:13:13] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2021-05-13 20:13:13] [INFO ] Deduced a trap composed of 32 places in 92 ms
[2021-05-13 20:13:13] [INFO ] Deduced a trap composed of 28 places in 82 ms
[2021-05-13 20:13:13] [INFO ] Deduced a trap composed of 19 places in 72 ms
[2021-05-13 20:13:13] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2021-05-13 20:13:13] [INFO ] Deduced a trap composed of 25 places in 64 ms
[2021-05-13 20:13:13] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2157 ms
[2021-05-13 20:13:13] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 35 ms.
[2021-05-13 20:13:15] [INFO ] Added : 226 causal constraints over 46 iterations in 1498 ms. Result :sat
[2021-05-13 20:13:15] [INFO ] Deduced a trap composed of 109 places in 163 ms
[2021-05-13 20:13:15] [INFO ] Deduced a trap composed of 108 places in 119 ms
[2021-05-13 20:13:15] [INFO ] Deduced a trap composed of 98 places in 175 ms
[2021-05-13 20:13:15] [INFO ] Deduced a trap composed of 100 places in 158 ms
[2021-05-13 20:13:16] [INFO ] Deduced a trap composed of 99 places in 166 ms
[2021-05-13 20:13:16] [INFO ] Deduced a trap composed of 105 places in 155 ms
[2021-05-13 20:13:16] [INFO ] Deduced a trap composed of 107 places in 163 ms
[2021-05-13 20:13:16] [INFO ] Deduced a trap composed of 110 places in 141 ms
[2021-05-13 20:13:16] [INFO ] Deduced a trap composed of 102 places in 167 ms
[2021-05-13 20:13:17] [INFO ] Deduced a trap composed of 28 places in 152 ms
[2021-05-13 20:13:17] [INFO ] Deduced a trap composed of 88 places in 164 ms
[2021-05-13 20:13:17] [INFO ] Deduced a trap composed of 103 places in 174 ms
[2021-05-13 20:13:17] [INFO ] Deduced a trap composed of 98 places in 169 ms
[2021-05-13 20:13:17] [INFO ] Deduced a trap composed of 105 places in 164 ms
[2021-05-13 20:13:18] [INFO ] Deduced a trap composed of 114 places in 153 ms
[2021-05-13 20:13:18] [INFO ] Deduced a trap composed of 108 places in 163 ms
[2021-05-13 20:13:18] [INFO ] Deduced a trap composed of 102 places in 156 ms
[2021-05-13 20:13:18] [INFO ] Deduced a trap composed of 103 places in 133 ms
[2021-05-13 20:13:19] [INFO ] Deduced a trap composed of 101 places in 164 ms
[2021-05-13 20:13:19] [INFO ] Deduced a trap composed of 102 places in 132 ms
[2021-05-13 20:13:19] [INFO ] Deduced a trap composed of 107 places in 157 ms
[2021-05-13 20:13:19] [INFO ] Deduced a trap composed of 99 places in 122 ms
[2021-05-13 20:13:19] [INFO ] Deduced a trap composed of 102 places in 146 ms
[2021-05-13 20:13:20] [INFO ] Deduced a trap composed of 26 places in 132 ms
[2021-05-13 20:13:20] [INFO ] Deduced a trap composed of 100 places in 166 ms
[2021-05-13 20:13:20] [INFO ] Deduced a trap composed of 93 places in 144 ms
[2021-05-13 20:13:20] [INFO ] Deduced a trap composed of 97 places in 188 ms
[2021-05-13 20:13:20] [INFO ] Deduced a trap composed of 101 places in 164 ms
[2021-05-13 20:13:21] [INFO ] Deduced a trap composed of 111 places in 170 ms
[2021-05-13 20:13:21] [INFO ] Deduced a trap composed of 97 places in 166 ms
[2021-05-13 20:13:21] [INFO ] Deduced a trap composed of 92 places in 131 ms
[2021-05-13 20:13:21] [INFO ] Deduced a trap composed of 102 places in 174 ms
[2021-05-13 20:13:22] [INFO ] Deduced a trap composed of 97 places in 167 ms
[2021-05-13 20:13:22] [INFO ] Deduced a trap composed of 101 places in 169 ms
[2021-05-13 20:13:22] [INFO ] Deduced a trap composed of 98 places in 149 ms
[2021-05-13 20:13:22] [INFO ] Deduced a trap composed of 104 places in 170 ms
[2021-05-13 20:13:23] [INFO ] Deduced a trap composed of 91 places in 186 ms
[2021-05-13 20:13:23] [INFO ] Deduced a trap composed of 96 places in 172 ms
[2021-05-13 20:13:23] [INFO ] Deduced a trap composed of 89 places in 167 ms
[2021-05-13 20:13:23] [INFO ] Deduced a trap composed of 111 places in 153 ms
[2021-05-13 20:13:23] [INFO ] Deduced a trap composed of 100 places in 171 ms
[2021-05-13 20:13:24] [INFO ] Deduced a trap composed of 111 places in 157 ms
[2021-05-13 20:13:24] [INFO ] Deduced a trap composed of 86 places in 160 ms
[2021-05-13 20:13:24] [INFO ] Deduced a trap composed of 92 places in 138 ms
[2021-05-13 20:13:24] [INFO ] Deduced a trap composed of 101 places in 158 ms
[2021-05-13 20:13:24] [INFO ] Deduced a trap composed of 99 places in 135 ms
[2021-05-13 20:13:25] [INFO ] Deduced a trap composed of 108 places in 135 ms
[2021-05-13 20:13:25] [INFO ] Deduced a trap composed of 95 places in 172 ms
[2021-05-13 20:13:25] [INFO ] Deduced a trap composed of 103 places in 166 ms
[2021-05-13 20:13:26] [INFO ] Deduced a trap composed of 102 places in 180 ms
[2021-05-13 20:13:26] [INFO ] Deduced a trap composed of 100 places in 148 ms
[2021-05-13 20:13:26] [INFO ] Deduced a trap composed of 104 places in 160 ms
[2021-05-13 20:13:26] [INFO ] Deduced a trap composed of 103 places in 166 ms
[2021-05-13 20:13:26] [INFO ] Deduced a trap composed of 100 places in 154 ms
[2021-05-13 20:13:27] [INFO ] Deduced a trap composed of 100 places in 153 ms
[2021-05-13 20:13:27] [INFO ] Deduced a trap composed of 92 places in 171 ms
[2021-05-13 20:13:27] [INFO ] Deduced a trap composed of 108 places in 175 ms
[2021-05-13 20:13:27] [INFO ] Deduced a trap composed of 90 places in 163 ms
[2021-05-13 20:13:28] [INFO ] Deduced a trap composed of 99 places in 166 ms
[2021-05-13 20:13:28] [INFO ] Deduced a trap composed of 106 places in 150 ms
[2021-05-13 20:13:28] [INFO ] Deduced a trap composed of 100 places in 159 ms
[2021-05-13 20:13:28] [INFO ] Deduced a trap composed of 104 places in 172 ms
[2021-05-13 20:13:29] [INFO ] Deduced a trap composed of 105 places in 183 ms
[2021-05-13 20:13:29] [INFO ] Deduced a trap composed of 105 places in 143 ms
[2021-05-13 20:13:29] [INFO ] Deduced a trap composed of 90 places in 234 ms
[2021-05-13 20:13:30] [INFO ] Deduced a trap composed of 114 places in 172 ms
[2021-05-13 20:13:30] [INFO ] Deduced a trap composed of 97 places in 172 ms
[2021-05-13 20:13:30] [INFO ] Deduced a trap composed of 101 places in 161 ms
[2021-05-13 20:13:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:13:31] [INFO ] Deduced a trap composed of 10 places in 221 ms
[2021-05-13 20:13:31] [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 (> (+ s0 s1 s2 s3 s4 s156 s167 s168 s273 s275) 0)") while checking expression at index 1
[2021-05-13 20:13:31] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2021-05-13 20:13:31] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 20:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:31] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-13 20:13:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:13:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2021-05-13 20:13:31] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-13 20:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:32] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2021-05-13 20:13:32] [INFO ] Deduced a trap composed of 17 places in 156 ms
[2021-05-13 20:13:32] [INFO ] Deduced a trap composed of 28 places in 136 ms
[2021-05-13 20:13:32] [INFO ] Deduced a trap composed of 12 places in 175 ms
[2021-05-13 20:13:33] [INFO ] Deduced a trap composed of 12 places in 186 ms
[2021-05-13 20:13:33] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2021-05-13 20:13:33] [INFO ] Deduced a trap composed of 26 places in 84 ms
[2021-05-13 20:13:33] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2021-05-13 20:13:33] [INFO ] Deduced a trap composed of 11 places in 83 ms
[2021-05-13 20:13:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1127 ms
[2021-05-13 20:13:33] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 25 ms.
[2021-05-13 20:13:35] [INFO ] Added : 226 causal constraints over 46 iterations in 1554 ms. Result :sat
[2021-05-13 20:13:35] [INFO ] Deduced a trap composed of 90 places in 177 ms
[2021-05-13 20:13:35] [INFO ] Deduced a trap composed of 90 places in 177 ms
[2021-05-13 20:13:35] [INFO ] Deduced a trap composed of 86 places in 160 ms
[2021-05-13 20:13:35] [INFO ] Deduced a trap composed of 83 places in 166 ms
[2021-05-13 20:13:36] [INFO ] Deduced a trap composed of 92 places in 172 ms
[2021-05-13 20:13:36] [INFO ] Deduced a trap composed of 92 places in 154 ms
[2021-05-13 20:13:36] [INFO ] Deduced a trap composed of 87 places in 181 ms
[2021-05-13 20:13:36] [INFO ] Deduced a trap composed of 87 places in 176 ms
[2021-05-13 20:13:36] [INFO ] Deduced a trap composed of 90 places in 186 ms
[2021-05-13 20:13:37] [INFO ] Deduced a trap composed of 85 places in 169 ms
[2021-05-13 20:13:37] [INFO ] Deduced a trap composed of 89 places in 147 ms
[2021-05-13 20:13:37] [INFO ] Deduced a trap composed of 93 places in 191 ms
[2021-05-13 20:13:37] [INFO ] Deduced a trap composed of 93 places in 172 ms
[2021-05-13 20:13:38] [INFO ] Deduced a trap composed of 95 places in 180 ms
[2021-05-13 20:13:38] [INFO ] Deduced a trap composed of 90 places in 189 ms
[2021-05-13 20:13:38] [INFO ] Deduced a trap composed of 93 places in 182 ms
[2021-05-13 20:13:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3634 ms
[2021-05-13 20:13:38] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2021-05-13 20:13:38] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 20:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:39] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2021-05-13 20:13:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:13:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 23 ms returned unsat
[2021-05-13 20:13:39] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2021-05-13 20:13:39] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 20:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:40] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2021-05-13 20:13:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:13:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 20:13:40] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2021-05-13 20:13:40] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 20:13:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:40] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2021-05-13 20:13:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:13:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2021-05-13 20:13:40] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-13 20:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:41] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2021-05-13 20:13:41] [INFO ] Deduced a trap composed of 11 places in 201 ms
[2021-05-13 20:13:41] [INFO ] Deduced a trap composed of 19 places in 232 ms
[2021-05-13 20:13:41] [INFO ] Deduced a trap composed of 11 places in 162 ms
[2021-05-13 20:13:42] [INFO ] Deduced a trap composed of 89 places in 173 ms
[2021-05-13 20:13:42] [INFO ] Deduced a trap composed of 19 places in 153 ms
[2021-05-13 20:13:42] [INFO ] Deduced a trap composed of 103 places in 169 ms
[2021-05-13 20:13:42] [INFO ] Deduced a trap composed of 17 places in 174 ms
[2021-05-13 20:13:42] [INFO ] Deduced a trap composed of 38 places in 121 ms
[2021-05-13 20:13:43] [INFO ] Deduced a trap composed of 41 places in 173 ms
[2021-05-13 20:13:43] [INFO ] Deduced a trap composed of 40 places in 142 ms
[2021-05-13 20:13:43] [INFO ] Deduced a trap composed of 44 places in 144 ms
[2021-05-13 20:13:43] [INFO ] Deduced a trap composed of 93 places in 143 ms
[2021-05-13 20:13:43] [INFO ] Deduced a trap composed of 14 places in 172 ms
[2021-05-13 20:13:43] [INFO ] Deduced a trap composed of 47 places in 144 ms
[2021-05-13 20:13:44] [INFO ] Deduced a trap composed of 15 places in 138 ms
[2021-05-13 20:13:44] [INFO ] Deduced a trap composed of 94 places in 140 ms
[2021-05-13 20:13:44] [INFO ] Deduced a trap composed of 93 places in 142 ms
[2021-05-13 20:13:44] [INFO ] Deduced a trap composed of 95 places in 138 ms
[2021-05-13 20:13:44] [INFO ] Deduced a trap composed of 98 places in 152 ms
[2021-05-13 20:13:44] [INFO ] Deduced a trap composed of 110 places in 174 ms
[2021-05-13 20:13:45] [INFO ] Deduced a trap composed of 102 places in 180 ms
[2021-05-13 20:13:45] [INFO ] Deduced a trap composed of 110 places in 130 ms
[2021-05-13 20:13:45] [INFO ] Deduced a trap composed of 97 places in 127 ms
[2021-05-13 20:13:45] [INFO ] Deduced a trap composed of 98 places in 128 ms
[2021-05-13 20:13:45] [INFO ] Deduced a trap composed of 108 places in 126 ms
[2021-05-13 20:13:45] [INFO ] Deduced a trap composed of 103 places in 131 ms
[2021-05-13 20:13:45] [INFO ] Deduced a trap composed of 109 places in 142 ms
[2021-05-13 20:13:46] [INFO ] Deduced a trap composed of 109 places in 123 ms
[2021-05-13 20:13:46] [INFO ] Deduced a trap composed of 93 places in 133 ms
[2021-05-13 20:13:46] [INFO ] Deduced a trap composed of 100 places in 121 ms
[2021-05-13 20:13:46] [INFO ] Deduced a trap composed of 106 places in 133 ms
[2021-05-13 20:13:46] [INFO ] Deduced a trap composed of 104 places in 121 ms
[2021-05-13 20:13:46] [INFO ] Deduced a trap composed of 113 places in 133 ms
[2021-05-13 20:13:46] [INFO ] Deduced a trap composed of 89 places in 127 ms
[2021-05-13 20:13:47] [INFO ] Deduced a trap composed of 111 places in 167 ms
[2021-05-13 20:13:47] [INFO ] Deduced a trap composed of 98 places in 144 ms
[2021-05-13 20:13:47] [INFO ] Deduced a trap composed of 104 places in 161 ms
[2021-05-13 20:13:47] [INFO ] Deduced a trap composed of 97 places in 138 ms
[2021-05-13 20:13:47] [INFO ] Deduced a trap composed of 101 places in 130 ms
[2021-05-13 20:13:47] [INFO ] Deduced a trap composed of 100 places in 144 ms
[2021-05-13 20:13:48] [INFO ] Deduced a trap composed of 102 places in 153 ms
[2021-05-13 20:13:48] [INFO ] Deduced a trap composed of 101 places in 151 ms
[2021-05-13 20:13:48] [INFO ] Deduced a trap composed of 96 places in 157 ms
[2021-05-13 20:13:48] [INFO ] Deduced a trap composed of 28 places in 157 ms
[2021-05-13 20:13:48] [INFO ] Deduced a trap composed of 95 places in 134 ms
[2021-05-13 20:13:48] [INFO ] Deduced a trap composed of 95 places in 134 ms
[2021-05-13 20:13:49] [INFO ] Deduced a trap composed of 104 places in 127 ms
[2021-05-13 20:13:49] [INFO ] Deduced a trap composed of 105 places in 115 ms
[2021-05-13 20:13:49] [INFO ] Deduced a trap composed of 98 places in 121 ms
[2021-05-13 20:13:49] [INFO ] Deduced a trap composed of 91 places in 126 ms
[2021-05-13 20:13:49] [INFO ] Deduced a trap composed of 115 places in 116 ms
[2021-05-13 20:13:49] [INFO ] Deduced a trap composed of 104 places in 115 ms
[2021-05-13 20:13:49] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 8590 ms
[2021-05-13 20:13:49] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 41 ms.
[2021-05-13 20:13:51] [INFO ] Added : 234 causal constraints over 48 iterations in 1716 ms. Result :sat
[2021-05-13 20:13:51] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2021-05-13 20:13:51] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 20:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:52] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2021-05-13 20:13:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:13:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 39 ms returned sat
[2021-05-13 20:13:52] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 20:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:13:52] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2021-05-13 20:13:53] [INFO ] Deduced a trap composed of 15 places in 206 ms
[2021-05-13 20:13:53] [INFO ] Deduced a trap composed of 17 places in 183 ms
[2021-05-13 20:13:53] [INFO ] Deduced a trap composed of 111 places in 197 ms
[2021-05-13 20:13:53] [INFO ] Deduced a trap composed of 96 places in 165 ms
[2021-05-13 20:13:53] [INFO ] Deduced a trap composed of 33 places in 170 ms
[2021-05-13 20:13:54] [INFO ] Deduced a trap composed of 27 places in 189 ms
[2021-05-13 20:13:54] [INFO ] Deduced a trap composed of 29 places in 164 ms
[2021-05-13 20:13:54] [INFO ] Deduced a trap composed of 114 places in 184 ms
[2021-05-13 20:13:54] [INFO ] Deduced a trap composed of 105 places in 190 ms
[2021-05-13 20:13:54] [INFO ] Deduced a trap composed of 19 places in 158 ms
[2021-05-13 20:13:55] [INFO ] Deduced a trap composed of 110 places in 171 ms
[2021-05-13 20:13:55] [INFO ] Deduced a trap composed of 105 places in 142 ms
[2021-05-13 20:13:55] [INFO ] Deduced a trap composed of 94 places in 145 ms
[2021-05-13 20:13:55] [INFO ] Deduced a trap composed of 91 places in 144 ms
[2021-05-13 20:13:55] [INFO ] Deduced a trap composed of 32 places in 143 ms
[2021-05-13 20:13:55] [INFO ] Deduced a trap composed of 113 places in 144 ms
[2021-05-13 20:13:56] [INFO ] Deduced a trap composed of 111 places in 144 ms
[2021-05-13 20:13:56] [INFO ] Deduced a trap composed of 98 places in 142 ms
[2021-05-13 20:13:56] [INFO ] Deduced a trap composed of 8 places in 149 ms
[2021-05-13 20:13:56] [INFO ] Deduced a trap composed of 94 places in 136 ms
[2021-05-13 20:13:56] [INFO ] Deduced a trap composed of 104 places in 163 ms
[2021-05-13 20:13:56] [INFO ] Deduced a trap composed of 101 places in 160 ms
[2021-05-13 20:13:57] [INFO ] Deduced a trap composed of 101 places in 134 ms
[2021-05-13 20:13:57] [INFO ] Deduced a trap composed of 95 places in 140 ms
[2021-05-13 20:13:57] [INFO ] Deduced a trap composed of 106 places in 128 ms
[2021-05-13 20:13:57] [INFO ] Deduced a trap composed of 97 places in 143 ms
[2021-05-13 20:13:57] [INFO ] Deduced a trap composed of 99 places in 134 ms
[2021-05-13 20:13:57] [INFO ] Deduced a trap composed of 99 places in 132 ms
[2021-05-13 20:13:57] [INFO ] Deduced a trap composed of 110 places in 131 ms
[2021-05-13 20:13:58] [INFO ] Deduced a trap composed of 106 places in 138 ms
[2021-05-13 20:13:58] [INFO ] Deduced a trap composed of 115 places in 140 ms
[2021-05-13 20:13:58] [INFO ] Deduced a trap composed of 102 places in 140 ms
[2021-05-13 20:13:58] [INFO ] Deduced a trap composed of 110 places in 136 ms
[2021-05-13 20:13:58] [INFO ] Deduced a trap composed of 107 places in 113 ms
[2021-05-13 20:13:58] [INFO ] Deduced a trap composed of 110 places in 156 ms
[2021-05-13 20:13:59] [INFO ] Deduced a trap composed of 12 places in 135 ms
[2021-05-13 20:13:59] [INFO ] Deduced a trap composed of 115 places in 167 ms
[2021-05-13 20:13:59] [INFO ] Deduced a trap composed of 105 places in 132 ms
[2021-05-13 20:13:59] [INFO ] Deduced a trap composed of 98 places in 141 ms
[2021-05-13 20:13:59] [INFO ] Deduced a trap composed of 98 places in 152 ms
[2021-05-13 20:13:59] [INFO ] Deduced a trap composed of 98 places in 168 ms
[2021-05-13 20:14:00] [INFO ] Deduced a trap composed of 107 places in 146 ms
[2021-05-13 20:14:00] [INFO ] Deduced a trap composed of 101 places in 164 ms
[2021-05-13 20:14:00] [INFO ] Deduced a trap composed of 108 places in 139 ms
[2021-05-13 20:14:00] [INFO ] Deduced a trap composed of 103 places in 148 ms
[2021-05-13 20:14:00] [INFO ] Deduced a trap composed of 93 places in 135 ms
[2021-05-13 20:14:00] [INFO ] Deduced a trap composed of 102 places in 168 ms
[2021-05-13 20:14:01] [INFO ] Deduced a trap composed of 98 places in 188 ms
[2021-05-13 20:14:01] [INFO ] Deduced a trap composed of 104 places in 156 ms
[2021-05-13 20:14:01] [INFO ] Deduced a trap composed of 105 places in 137 ms
[2021-05-13 20:14:01] [INFO ] Deduced a trap composed of 111 places in 130 ms
[2021-05-13 20:14:01] [INFO ] Deduced a trap composed of 98 places in 173 ms
[2021-05-13 20:14:02] [INFO ] Deduced a trap composed of 108 places in 140 ms
[2021-05-13 20:14:02] [INFO ] Deduced a trap composed of 100 places in 169 ms
[2021-05-13 20:14:02] [INFO ] Deduced a trap composed of 97 places in 209 ms
[2021-05-13 20:14:02] [INFO ] Deduced a trap composed of 95 places in 141 ms
[2021-05-13 20:14:02] [INFO ] Deduced a trap composed of 101 places in 144 ms
[2021-05-13 20:14:03] [INFO ] Deduced a trap composed of 100 places in 137 ms
[2021-05-13 20:14:03] [INFO ] Deduced a trap composed of 95 places in 136 ms
[2021-05-13 20:14:03] [INFO ] Deduced a trap composed of 96 places in 127 ms
[2021-05-13 20:14:03] [INFO ] Deduced a trap composed of 107 places in 130 ms
[2021-05-13 20:14:03] [INFO ] Deduced a trap composed of 108 places in 128 ms
[2021-05-13 20:14:03] [INFO ] Trap strengthening (SAT) tested/added 63/62 trap constraints in 10847 ms
[2021-05-13 20:14:03] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 30 ms.
[2021-05-13 20:14:05] [INFO ] Added : 275 causal constraints over 56 iterations in 1697 ms. Result :sat
[2021-05-13 20:14:05] [INFO ] Deduced a trap composed of 94 places in 182 ms
[2021-05-13 20:14:06] [INFO ] Deduced a trap composed of 96 places in 192 ms
[2021-05-13 20:14:06] [INFO ] Deduced a trap composed of 99 places in 178 ms
[2021-05-13 20:14:06] [INFO ] Deduced a trap composed of 97 places in 183 ms
[2021-05-13 20:14:06] [INFO ] Deduced a trap composed of 116 places in 183 ms
[2021-05-13 20:14:07] [INFO ] Deduced a trap composed of 101 places in 177 ms
[2021-05-13 20:14:07] [INFO ] Deduced a trap composed of 99 places in 181 ms
[2021-05-13 20:14:07] [INFO ] Deduced a trap composed of 110 places in 186 ms
[2021-05-13 20:14:08] [INFO ] Deduced a trap composed of 90 places in 183 ms
[2021-05-13 20:14:08] [INFO ] Deduced a trap composed of 96 places in 179 ms
[2021-05-13 20:14:08] [INFO ] Deduced a trap composed of 96 places in 170 ms
[2021-05-13 20:14:08] [INFO ] Deduced a trap composed of 108 places in 184 ms
[2021-05-13 20:14:09] [INFO ] Deduced a trap composed of 106 places in 184 ms
[2021-05-13 20:14:09] [INFO ] Deduced a trap composed of 88 places in 177 ms
[2021-05-13 20:14:09] [INFO ] Deduced a trap composed of 101 places in 182 ms
[2021-05-13 20:14:10] [INFO ] Deduced a trap composed of 106 places in 191 ms
[2021-05-13 20:14:10] [INFO ] Deduced a trap composed of 108 places in 174 ms
[2021-05-13 20:14:10] [INFO ] Deduced a trap composed of 102 places in 179 ms
[2021-05-13 20:14:10] [INFO ] Deduced a trap composed of 104 places in 178 ms
[2021-05-13 20:14:11] [INFO ] Deduced a trap composed of 106 places in 175 ms
[2021-05-13 20:14:11] [INFO ] Deduced a trap composed of 109 places in 175 ms
[2021-05-13 20:14:11] [INFO ] Deduced a trap composed of 107 places in 181 ms
[2021-05-13 20:14:12] [INFO ] Deduced a trap composed of 95 places in 158 ms
[2021-05-13 20:14:12] [INFO ] Deduced a trap composed of 100 places in 182 ms
[2021-05-13 20:14:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:14:12] [INFO ] Deduced a trap composed of 10 places in 223 ms
[2021-05-13 20:14: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 (> (+ s0 s1 s2 s3 s4 s156 s167 s168 s273 s275) 0)") while checking expression at index 6
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2021-05-13 20:14:12] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 20:14:12] [INFO ] Flatten gal took : 78 ms
FORMULA BusinessProcesses-PT-09-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:14:12] [INFO ] Applying decomposition
[2021-05-13 20:14:12] [INFO ] Flatten gal took : 30 ms
[2021-05-13 20:14:12] [INFO ] Decomposing Gal with order
[2021-05-13 20:14:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 20:14:13] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-13 20:14:13] [INFO ] Flatten gal took : 74 ms
[2021-05-13 20:14:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 34 ms.
[2021-05-13 20:14:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 20:14:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-09 @ 3570 seconds

FORMULA BusinessProcesses-PT-09-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3438
rslt: Output for LTLCardinality @ BusinessProcesses-PT-09

{
"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": "Thu May 13 20:14:13 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X ((F (G ((((p280 <= 0)) OR ((1 <= p89))))) AND G (F (((1 <= p198)))))) AND (((p280 <= 0)) OR ((1 <= p89)))))",
"processed_size": 115,
"rewrites": 58
},
"result":
{
"edges": 151,
"markings": 151,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((X (G (((1 <= p74)))) OR ((1 <= p74))))",
"processed_size": 42,
"rewrites": 58
},
"result":
{
"edges": 175,
"markings": 175,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 509
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 4,
"aconj": 10,
"adisj": 3,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F ((X (F ((((p357 <= 0)) OR ((1 <= p284))))) OR ((G ((F (G ((((p357 <= 0)) OR ((1 <= p284))))) OR (((p357 <= 0)) OR ((1 <= p284))))) AND X (F ((((p357 <= 0)) OR ((1 <= p284)))))) OR (((p113 <= 0)) OR ((1 <= p113))))))))",
"processed_size": 228,
"rewrites": 58
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 14
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (F (((1 <= p11) AND (((p21 <= 0)) OR ((1 <= p28)))))) AND (F ((((p70 <= 0)) OR ((1 <= p260)))) OR X (((1 <= p11))))))",
"processed_size": 125,
"rewrites": 58
},
"result":
{
"edges": 152,
"markings": 152,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p49 <= 0))",
"processed_size": 12,
"rewrites": 60
},
"result":
{
"edges": 83,
"markings": 83,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p342))))",
"processed_size": 21,
"rewrites": 58
},
"result":
{
"edges": 85,
"markings": 84,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((((1 <= p43)) OR ((p100 <= 0)) OR ((1 <= p270))))",
"processed_size": 54,
"rewrites": 58
},
"result":
{
"edges": 47009878,
"markings": 6811160,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p95 <= 0)) OR ((1 <= p373))) U (((p289 <= 0)) OR ((1 <= p179))))",
"processed_size": 70,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "G (F ((((1 <= p289)) AND ((p179 <= 0)))))",
"processed_size": 41,
"rewrites": 58
},
"result":
{
"edges": 86,
"markings": 86,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 31872,
"runtime": 132.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : X((X((F(G(**)) AND G(F(**)))) AND **)) : ((** U **) AND G(F(*))) : X((X(G(**)) OR **)) : (X(G(*)) OR **) : X(X(F((X(F(**)) OR ((G((F(G(**)) OR (** OR **))) AND X(F(**))) OR (** OR **)))))) : X((X(F(**)) AND (F(**) OR X(**)))) : G(**) : F(G(**))"
},
"net":
{
"arcs": 1148,
"conflict_clusters": 300,
"places": 403,
"places_significant": 338,
"singleton_clusters": 0,
"transitions": 374
},
"result":
{
"preliminary_value": "no no no no no yes no no no ",
"value": "no no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 777/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 403
lola: finding significant places
lola: 403 places, 374 transitions, 338 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: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p284 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p342 <= 1)
lola: (G (X ((((p198 <= 0)) OR ((1 <= p51))))) U ((0 <= 0) U ((1 <= p49)))) : X ((NOT(X ((NOT(F (G ((((p280 <= 0)) OR ((1 <= p89)))))) OR NOT(F (G (F (((1 <= p198))))))))) AND (((p280 <= 0)) OR ((1 <= p89))))) : (((((p95 <= 0)) OR ((1 <= p373))) U (((p289 <= 0)) OR ((1 <= p179)))) AND NOT(F (G ((((p289 <= 0)) OR ((1 <= p179))))))) : (G (X (X (((1 <= p74))))) OR X (((1 <= p74)))) : (X (G (NOT(((1 <= 0) U (((p45 <= 0)) OR ((1 <= p247))))))) OR (((1 <= p263)) AND ((p293 <= 0)))) : X (F (X ((((G (((F (G ((((p357 <= 0)) OR ((1 <= p284))))) OR ((p357 <= 0))) OR ((1 <= p284)))) U F (X ((((p357 <= 0)) OR ((1 <= p284)))))) OR ((p113 <= 0))) OR ((1 <= p113)))))) : NOT(X ((NOT(X (F (((1 <= p11) AND (((p21 <= 0)) OR ((1 <= p28))))))) OR (NOT(F ((((p70 <= 0)) OR ((1 <= p260))))) AND NOT(X (((1 <= p11)))))))) : G ((((1 <= p43)) OR ((p100 <= 0)) OR ((1 <= p270)))) : F (X (F (((1 <= 0) U G (((1 <= p342)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((F (G ((((p280 <= 0)) OR ((1 <= p89))))) AND G (F (((1 <= p198)))))) AND (((p280 <= 0)) OR ((1 <= p89)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((F (G ((((p280 <= 0)) OR ((1 <= p89))))) AND G (F (((1 <= p198)))))) AND (((p280 <= 0)) OR ((1 <= p89)))))
lola: processed formula length: 115
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 151 markings, 151 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p74)))) OR ((1 <= p74))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p74)))) OR ((1 <= p74))))
lola: processed formula length: 42
lola: 58 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: 175 markings, 175 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((1 <= p45)) AND ((p247 <= 0))))) OR (((1 <= p263)) AND ((p293 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p263)) AND ((p293 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p263)) AND ((p293 <= 0)))
lola: processed formula length: 33
lola: 58 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 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p45)) AND ((p247 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p45)) AND ((p247 <= 0)))))
lola: processed formula length: 40
lola: 58 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: 175 markings, 175 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (F ((((p357 <= 0)) OR ((1 <= p284))))) OR ((G ((F (G ((((p357 <= 0)) OR ((1 <= p284))))) OR (((p357 <= 0)) OR ((1 <= p284))))) AND X (F ((((p357 <= 0)) OR ((1 <= p284)))))) OR (((p113 <= 0)) OR ((1 <= p113))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (F ((((p357 <= 0)) OR ((1 <= p284))))) OR ((G ((F (G ((((p357 <= 0)) OR ((1 <= p284))))) OR (((p357 <= 0)) OR ((1 <= p284))))) AND X (F ((((p357 <= 0)) OR ((1 <= p284)))))) OR (((p113 <= 0)) OR ((1 <= p113))))))))
lola: processed formula length: 228
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((1 <= p11) AND (((p21 <= 0)) OR ((1 <= p28)))))) AND (F ((((p70 <= 0)) OR ((1 <= p260)))) OR X (((1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((1 <= p11) AND (((p21 <= 0)) OR ((1 <= p28)))))) AND (F ((((p70 <= 0)) OR ((1 <= p260)))) OR X (((1 <= p11))))))
lola: processed formula length: 125
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 152 markings, 152 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p49)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p49 <= 0))
lola: processed formula length: 12
lola: 60 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: 83 markings, 83 edges
lola: ========================================
lola: subprocess 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p342))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p342))))
lola: processed formula length: 21
lola: 58 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: 84 markings, 85 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p43)) OR ((p100 <= 0)) OR ((1 <= p270))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p43)) OR ((p100 <= 0)) OR ((1 <= p270))))
lola: processed formula length: 54
lola: 58 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: 366548 markings, 1853739 edges, 73310 markings/sec, 0 secs
lola: 625174 markings, 3487899 edges, 51725 markings/sec, 5 secs
lola: 920487 markings, 5426069 edges, 59063 markings/sec, 10 secs
lola: 1218515 markings, 7252901 edges, 59606 markings/sec, 15 secs
lola: 1533821 markings, 9208927 edges, 63061 markings/sec, 20 secs
lola: 1842909 markings, 11161509 edges, 61818 markings/sec, 25 secs
lola: 2157865 markings, 13134957 edges, 62991 markings/sec, 30 secs
lola: 2450216 markings, 15057222 edges, 58470 markings/sec, 35 secs
lola: 2700021 markings, 16859545 edges, 49961 markings/sec, 40 secs
lola: 2947569 markings, 18640722 edges, 49510 markings/sec, 45 secs
lola: 3174030 markings, 20332373 edges, 45292 markings/sec, 50 secs
lola: 3386445 markings, 21979114 edges, 42483 markings/sec, 55 secs
lola: 3592907 markings, 23587788 edges, 41292 markings/sec, 60 secs
lola: 3792013 markings, 25226675 edges, 39821 markings/sec, 65 secs
lola: 4044821 markings, 27068807 edges, 50562 markings/sec, 70 secs
lola: 4314426 markings, 29002627 edges, 53921 markings/sec, 75 secs
lola: 4563488 markings, 30886949 edges, 49812 markings/sec, 80 secs
lola: 4803090 markings, 32756036 edges, 47920 markings/sec, 85 secs
lola: 5057668 markings, 34627665 edges, 50916 markings/sec, 90 secs
lola: 5317086 markings, 36507916 edges, 51884 markings/sec, 95 secs
lola: 5551937 markings, 38357718 edges, 46970 markings/sec, 100 secs
lola: 5794769 markings, 40191296 edges, 48566 markings/sec, 105 secs
lola: 6052577 markings, 42082635 edges, 51562 markings/sec, 110 secs
lola: 6294726 markings, 43943659 edges, 48430 markings/sec, 115 secs
lola: 6573386 markings, 45835806 edges, 55732 markings/sec, 120 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6811160 markings, 47009878 edges
lola: ========================================
lola: subprocess 8 will run for 3438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p95 <= 0)) OR ((1 <= p373))) U (((p289 <= 0)) OR ((1 <= p179)))) AND G (F ((((1 <= p289)) AND ((p179 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p95 <= 0)) OR ((1 <= p373))) U (((p289 <= 0)) OR ((1 <= p179))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p95 <= 0)) OR ((1 <= p373))) U (((p289 <= 0)) OR ((1 <= p179))))
lola: processed formula length: 70
lola: 58 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: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((((p95 <= 0)) OR ((1 <= p373))) U (((p289 <= 0)) OR ((1 <= p179)))) AND G (F ((((1 <= p289)) AND ((p179 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((((p95 <= 0)) OR ((1 <= p373))) U (((p289 <= 0)) OR ((1 <= p179))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p95 <= 0)) OR ((1 <= p373))) U (((p289 <= 0)) OR ((1 <= p179))))
lola: processed formula length: 70
lola: 58 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: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p289)) AND ((p179 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p289)) AND ((p179 <= 0)))))
lola: processed formula length: 41
lola: 58 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: 86 markings, 86 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no
lola:
preliminary result: no no no no no yes no no no
lola: ========================================
lola: memory consumption: 31872 KB
lola: time consumption: 132 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="BusinessProcesses-PT-09"
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 BusinessProcesses-PT-09, 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 r037-tajo-162038177000193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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