Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914000539.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 146K Mar 24 05:37 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-12-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591162243800

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:30:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:30:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:30:45] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2020-06-03 05:30:45] [INFO ] Transformed 586 places.
[2020-06-03 05:30:45] [INFO ] Transformed 525 transitions.
[2020-06-03 05:30:45] [INFO ] Found NUPN structural information;
[2020-06-03 05:30:45] [INFO ] Parsed PT model containing 586 places and 525 transitions in 144 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
Incomplete random walk after 100000 steps, including 731 resets, run finished after 407 ms. (steps per millisecond=245 ) properties seen :[0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1]
// Phase 1: matrix 521 rows 582 cols
[2020-06-03 05:30:45] [INFO ] Computed 98 place invariants in 31 ms
[2020-06-03 05:30:46] [INFO ] [Real]Absence check using 55 positive place invariants in 70 ms returned sat
[2020-06-03 05:30:46] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 31 ms returned sat
[2020-06-03 05:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:30:46] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2020-06-03 05:30:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:30:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 76 ms returned sat
[2020-06-03 05:30:47] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 31 ms returned sat
[2020-06-03 05:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:30:47] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 118 places in 223 ms
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 108 places in 230 ms
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 103 places in 136 ms
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 12 places in 161 ms
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 26 places in 152 ms
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 114 places in 199 ms
[2020-06-03 05:30:49] [INFO ] Deduced a trap composed of 20 places in 169 ms
[2020-06-03 05:30:49] [INFO ] Deduced a trap composed of 27 places in 167 ms
[2020-06-03 05:30:49] [INFO ] Deduced a trap composed of 113 places in 195 ms
[2020-06-03 05:30:49] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 115 places in 201 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 109 places in 201 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 107 places in 221 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 46 places in 109 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 41 places in 106 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 45 places in 82 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 44 places in 107 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 45 places in 183 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 45 places in 81 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 52 places in 108 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 54 places in 97 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 29 places in 74 ms
[2020-06-03 05:30:53] [INFO ] Deduced a trap composed of 47 places in 2012 ms
[2020-06-03 05:30:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6059 ms
[2020-06-03 05:30:53] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 37 ms.
[2020-06-03 05:30:57] [INFO ] Added : 320 causal constraints over 64 iterations in 3387 ms. Result :sat
[2020-06-03 05:30:57] [INFO ] [Real]Absence check using 55 positive place invariants in 70 ms returned sat
[2020-06-03 05:30:57] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 80 ms returned sat
[2020-06-03 05:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:30:58] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2020-06-03 05:30:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:30:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 394 ms returned sat
[2020-06-03 05:30:58] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 72 ms returned sat
[2020-06-03 05:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:00] [INFO ] [Nat]Absence check using state equation in 1466 ms returned sat
[2020-06-03 05:31:00] [INFO ] Deduced a trap composed of 16 places in 321 ms
[2020-06-03 05:31:00] [INFO ] Deduced a trap composed of 13 places in 267 ms
[2020-06-03 05:31:01] [INFO ] Deduced a trap composed of 11 places in 275 ms
[2020-06-03 05:31:01] [INFO ] Deduced a trap composed of 18 places in 340 ms
[2020-06-03 05:31:01] [INFO ] Deduced a trap composed of 113 places in 343 ms
[2020-06-03 05:31:02] [INFO ] Deduced a trap composed of 103 places in 329 ms
[2020-06-03 05:31:02] [INFO ] Deduced a trap composed of 15 places in 346 ms
[2020-06-03 05:31:03] [INFO ] Deduced a trap composed of 110 places in 348 ms
[2020-06-03 05:31:03] [INFO ] Deduced a trap composed of 21 places in 332 ms
[2020-06-03 05:31:03] [INFO ] Deduced a trap composed of 19 places in 331 ms
[2020-06-03 05:31:04] [INFO ] Deduced a trap composed of 107 places in 334 ms
[2020-06-03 05:31:05] [INFO ] Deduced a trap composed of 32 places in 1757 ms
[2020-06-03 05:31:07] [INFO ] Deduced a trap composed of 21 places in 1723 ms
[2020-06-03 05:31:07] [INFO ] Deduced a trap composed of 20 places in 210 ms
[2020-06-03 05:31:08] [INFO ] Deduced a trap composed of 22 places in 155 ms
[2020-06-03 05:31:09] [INFO ] Deduced a trap composed of 22 places in 1713 ms
[2020-06-03 05:31:10] [INFO ] Deduced a trap composed of 13 places in 157 ms
[2020-06-03 05:31:10] [INFO ] Deduced a trap composed of 27 places in 155 ms
[2020-06-03 05:31:10] [INFO ] Deduced a trap composed of 12 places in 152 ms
[2020-06-03 05:31:10] [INFO ] Deduced a trap composed of 27 places in 189 ms
[2020-06-03 05:31:10] [INFO ] Deduced a trap composed of 25 places in 186 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 122 places in 171 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 25 places in 163 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 25 places in 164 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 28 places in 173 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 24 places in 165 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 117 places in 170 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 112 places in 158 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 115 places in 162 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 112 places in 168 ms
[2020-06-03 05:31:13] [INFO ] Deduced a trap composed of 114 places in 179 ms
[2020-06-03 05:31:13] [INFO ] Deduced a trap composed of 111 places in 151 ms
[2020-06-03 05:31:13] [INFO ] Deduced a trap composed of 29 places in 203 ms
[2020-06-03 05:31:13] [INFO ] Deduced a trap composed of 46 places in 147 ms
[2020-06-03 05:31:13] [INFO ] Deduced a trap composed of 45 places in 164 ms
[2020-06-03 05:31:14] [INFO ] Deduced a trap composed of 107 places in 153 ms
[2020-06-03 05:31:14] [INFO ] Deduced a trap composed of 18 places in 156 ms
[2020-06-03 05:31:14] [INFO ] Deduced a trap composed of 104 places in 308 ms
[2020-06-03 05:31:14] [INFO ] Deduced a trap composed of 117 places in 264 ms
[2020-06-03 05:31:15] [INFO ] Deduced a trap composed of 132 places in 247 ms
[2020-06-03 05:31:15] [INFO ] Deduced a trap composed of 22 places in 226 ms
[2020-06-03 05:31:15] [INFO ] Deduced a trap composed of 111 places in 150 ms
[2020-06-03 05:31:15] [INFO ] Deduced a trap composed of 22 places in 149 ms
[2020-06-03 05:31:16] [INFO ] Deduced a trap composed of 39 places in 150 ms
[2020-06-03 05:31:16] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-06-03 05:31:16] [INFO ] Deduced a trap composed of 29 places in 210 ms
[2020-06-03 05:31:16] [INFO ] Deduced a trap composed of 20 places in 333 ms
[2020-06-03 05:31:17] [INFO ] Deduced a trap composed of 40 places in 299 ms
[2020-06-03 05:31:17] [INFO ] Deduced a trap composed of 45 places in 272 ms
[2020-06-03 05:31:17] [INFO ] Deduced a trap composed of 28 places in 198 ms
[2020-06-03 05:31:18] [INFO ] Deduced a trap composed of 35 places in 518 ms
[2020-06-03 05:31:18] [INFO ] Deduced a trap composed of 42 places in 150 ms
[2020-06-03 05:31:18] [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 s165 s166 s167 s176 s177 s178 s182 s191 s192 s193 s209 s210 s211 s228 s229 s230 s236 s239 s270 s348 s349 s350 s359 s369 s374 s379 s393 s394 s395 s399 s404 s409 s428 s429 s432 s521 s522 s535 s536) 0)") while checking expression at index 1
[2020-06-03 05:31:18] [INFO ] [Real]Absence check using 55 positive place invariants in 70 ms returned sat
[2020-06-03 05:31:18] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2020-06-03 05:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:19] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2020-06-03 05:31:24] [INFO ] Deduced a trap composed of 11 places in 4497 ms
[2020-06-03 05:31:27] [INFO ] Deduced a trap composed of 13 places in 3271 ms
[2020-06-03 05:31:32] [INFO ] Deduced a trap composed of 22 places in 4774 ms
[2020-06-03 05:31:35] [INFO ] Deduced a trap composed of 11 places in 3083 ms
[2020-06-03 05:31:35] [INFO ] Deduced a trap composed of 14 places in 512 ms
[2020-06-03 05:31:36] [INFO ] Deduced a trap composed of 18 places in 273 ms
[2020-06-03 05:31:36] [INFO ] Deduced a trap composed of 25 places in 266 ms
[2020-06-03 05:31:36] [INFO ] Deduced a trap composed of 30 places in 151 ms
[2020-06-03 05:31:36] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2020-06-03 05:31:36] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2020-06-03 05:31:37] [INFO ] Deduced a trap composed of 21 places in 118 ms
[2020-06-03 05:31:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 17616 ms
[2020-06-03 05:31:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:31:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 198 ms returned sat
[2020-06-03 05:31:37] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 90 ms returned sat
[2020-06-03 05:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:38] [INFO ] [Nat]Absence check using state equation in 841 ms returned sat
[2020-06-03 05:31:38] [INFO ] Deduced a trap composed of 11 places in 417 ms
[2020-06-03 05:31:39] [INFO ] Deduced a trap composed of 15 places in 192 ms
[2020-06-03 05:31:39] [INFO ] Deduced a trap composed of 110 places in 409 ms
[2020-06-03 05:31:39] [INFO ] Deduced a trap composed of 107 places in 308 ms
[2020-06-03 05:31:42] [INFO ] Deduced a trap composed of 106 places in 2136 ms
[2020-06-03 05:31:46] [INFO ] Deduced a trap composed of 17 places in 4507 ms
[2020-06-03 05:31:48] [INFO ] Deduced a trap composed of 12 places in 1517 ms
[2020-06-03 05:31:50] [INFO ] Deduced a trap composed of 21 places in 2183 ms
[2020-06-03 05:31:50] [INFO ] Deduced a trap composed of 13 places in 154 ms
[2020-06-03 05:31:50] [INFO ] Deduced a trap composed of 19 places in 146 ms
[2020-06-03 05:31:50] [INFO ] Deduced a trap composed of 11 places in 149 ms
[2020-06-03 05:31:51] [INFO ] Deduced a trap composed of 20 places in 146 ms
[2020-06-03 05:31:51] [INFO ] Deduced a trap composed of 22 places in 584 ms
[2020-06-03 05:31:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 13257 ms
[2020-06-03 05:31:51] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 105 ms.
[2020-06-03 05:31:53] [INFO ] Added : 248 causal constraints over 50 iterations in 2239 ms. Result :sat
[2020-06-03 05:31:54] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-06-03 05:31:54] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:54] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2020-06-03 05:31:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:31:55] [INFO ] [Nat]Absence check using 55 positive place invariants in 142 ms returned sat
[2020-06-03 05:31:55] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 229 ms returned sat
[2020-06-03 05:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:58] [INFO ] [Nat]Absence check using state equation in 3237 ms returned sat
[2020-06-03 05:31:58] [INFO ] Deduced a trap composed of 10 places in 154 ms
[2020-06-03 05:31:58] [INFO ] Deduced a trap composed of 15 places in 149 ms
[2020-06-03 05:32:01] [INFO ] Deduced a trap composed of 20 places in 3070 ms
[2020-06-03 05:32:04] [INFO ] Deduced a trap composed of 29 places in 2833 ms
[2020-06-03 05:32:08] [INFO ] Deduced a trap composed of 14 places in 4124 ms
[2020-06-03 05:32:09] [INFO ] Deduced a trap composed of 11 places in 913 ms
[2020-06-03 05:32:10] [INFO ] Deduced a trap composed of 8 places in 199 ms
[2020-06-03 05:32:15] [INFO ] Deduced a trap composed of 17 places in 5224 ms
[2020-06-03 05:32:15] [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 s5 s6 s7 s8 s9 s10 s11 s12 s174 s368 s369 s370) 0)") while checking expression at index 3
[2020-06-03 05:32:15] [INFO ] [Real]Absence check using 55 positive place invariants in 100 ms returned sat
[2020-06-03 05:32:15] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 234 ms returned sat
[2020-06-03 05:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:21] [INFO ] [Real]Absence check using state equation in 5337 ms returned sat
[2020-06-03 05:32:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:32:21] [INFO ] [Nat]Absence check using 55 positive place invariants in 41 ms returned sat
[2020-06-03 05:32:21] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-06-03 05:32:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:23] [INFO ] [Nat]Absence check using state equation in 2234 ms returned sat
[2020-06-03 05:32:23] [INFO ] Deduced a trap composed of 19 places in 311 ms
[2020-06-03 05:32:24] [INFO ] Deduced a trap composed of 15 places in 302 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 14 places in 2747 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 27 places in 158 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 21 places in 96 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 27 places in 158 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 20 places in 91 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 16 places in 106 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 20 places in 73 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 38 places in 86 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 45 places in 96 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 50 places in 75 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 46 places in 75 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 56 places in 85 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 41 places in 73 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 36 places in 95 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 60 places in 62 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 78 places in 70 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 83 places in 72 ms
[2020-06-03 05:32:29] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5508 ms
[2020-06-03 05:32:29] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 49 ms.
[2020-06-03 05:32:30] [INFO ] Added : 189 causal constraints over 39 iterations in 1571 ms. Result :sat
[2020-06-03 05:32:30] [INFO ] [Real]Absence check using 55 positive place invariants in 183 ms returned sat
[2020-06-03 05:32:31] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 78 ms returned sat
[2020-06-03 05:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:33] [INFO ] [Real]Absence check using state equation in 2729 ms returned sat
[2020-06-03 05:32:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:32:34] [INFO ] [Nat]Absence check using 55 positive place invariants in 238 ms returned sat
[2020-06-03 05:32:34] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2020-06-03 05:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:36] [INFO ] [Nat]Absence check using state equation in 2582 ms returned sat
[2020-06-03 05:32:36] [INFO ] Deduced a trap composed of 21 places in 205 ms
[2020-06-03 05:32:37] [INFO ] Deduced a trap composed of 14 places in 288 ms
[2020-06-03 05:32:37] [INFO ] Deduced a trap composed of 33 places in 326 ms
[2020-06-03 05:32:37] [INFO ] Deduced a trap composed of 20 places in 324 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 149 places in 320 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 19 places in 145 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 28 places in 143 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 27 places in 65 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 24 places in 75 ms
[2020-06-03 05:32:41] [INFO ] Deduced a trap composed of 30 places in 2759 ms
[2020-06-03 05:32:44] [INFO ] Deduced a trap composed of 52 places in 2705 ms
[2020-06-03 05:32:49] [INFO ] Deduced a trap composed of 134 places in 4837 ms
[2020-06-03 05:32:55] [INFO ] Deduced a trap composed of 21 places in 6203 ms
[2020-06-03 05:32:55] [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 s5 s6 s7 s8 s9 s10 s11 s12 s174 s176 s177 s178 s179 s353 s354 s355) 0)") while checking expression at index 5
[2020-06-03 05:32:55] [INFO ] [Real]Absence check using 55 positive place invariants in 61 ms returned sat
[2020-06-03 05:32:55] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 37 ms returned sat
[2020-06-03 05:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:57] [INFO ] [Real]Absence check using state equation in 1563 ms returned sat
[2020-06-03 05:32:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:32:57] [INFO ] [Nat]Absence check using 55 positive place invariants in 393 ms returned sat
[2020-06-03 05:32:58] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 292 ms returned sat
[2020-06-03 05:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:33:00] [INFO ] [Nat]Absence check using state equation in 2465 ms returned sat
[2020-06-03 05:33:02] [INFO ] Deduced a trap composed of 16 places in 1376 ms
[2020-06-03 05:33:06] [INFO ] Deduced a trap composed of 14 places in 4484 ms
[2020-06-03 05:33:09] [INFO ] Deduced a trap composed of 11 places in 2585 ms
[2020-06-03 05:33:14] [INFO ] Deduced a trap composed of 21 places in 5478 ms
[2020-06-03 05:33:17] [INFO ] Deduced a trap composed of 11 places in 2695 ms
[2020-06-03 05:33:17] [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 s236 s239 s403 s404 s405 s409 s539 s540) 0)") while checking expression at index 6
[2020-06-03 05:33:17] [INFO ] [Real]Absence check using 55 positive place invariants in 222 ms returned sat
[2020-06-03 05:33:18] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 173 ms returned sat
[2020-06-03 05:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:33:21] [INFO ] [Real]Absence check using state equation in 3305 ms returned sat
[2020-06-03 05:33:22] [INFO ] Deduced a trap composed of 11 places in 1544 ms
[2020-06-03 05:33:25] [INFO ] Deduced a trap composed of 13 places in 2453 ms
[2020-06-03 05:33:27] [INFO ] Deduced a trap composed of 19 places in 2338 ms
[2020-06-03 05:33:31] [INFO ] Deduced a trap composed of 29 places in 3199 ms
[2020-06-03 05:33:34] [INFO ] Deduced a trap composed of 19 places in 3074 ms
[2020-06-03 05:33:34] [INFO ] Deduced a trap composed of 31 places in 139 ms
[2020-06-03 05:33:35] [INFO ] Deduced a trap composed of 39 places in 745 ms
[2020-06-03 05:33:36] [INFO ] Deduced a trap composed of 20 places in 1217 ms
[2020-06-03 05:33:36] [INFO ] Deduced a trap composed of 29 places in 128 ms
[2020-06-03 05:33:36] [INFO ] Deduced a trap composed of 21 places in 125 ms
[2020-06-03 05:33:37] [INFO ] Deduced a trap composed of 46 places in 369 ms
[2020-06-03 05:33:40] [INFO ] Deduced a trap composed of 17 places in 2987 ms
[2020-06-03 05:33:40] [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 s5 s6 s7 s8 s9 s10 s11 s12 s174 s368 s369 s370) 0)") while checking expression at index 7
[2020-06-03 05:33:40] [INFO ] [Real]Absence check using 55 positive place invariants in 189 ms returned sat
[2020-06-03 05:33:40] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 101 ms returned sat
[2020-06-03 05:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:33:43] [INFO ] [Real]Absence check using state equation in 3214 ms returned sat
[2020-06-03 05:33:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:33:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 232 ms returned sat
[2020-06-03 05:33:44] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 161 ms returned sat
[2020-06-03 05:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:33:44] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2020-06-03 05:33:45] [INFO ] Deduced a trap composed of 13 places in 146 ms
[2020-06-03 05:33:45] [INFO ] Deduced a trap composed of 11 places in 156 ms
[2020-06-03 05:33:45] [INFO ] Deduced a trap composed of 8 places in 447 ms
[2020-06-03 05:33:45] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-06-03 05:33:46] [INFO ] Deduced a trap composed of 104 places in 147 ms
[2020-06-03 05:33:48] [INFO ] Deduced a trap composed of 117 places in 1917 ms
[2020-06-03 05:33:48] [INFO ] Deduced a trap composed of 104 places in 912 ms
[2020-06-03 05:33:49] [INFO ] Deduced a trap composed of 115 places in 251 ms
[2020-06-03 05:33:49] [INFO ] Deduced a trap composed of 19 places in 271 ms
[2020-06-03 05:33:49] [INFO ] Deduced a trap composed of 21 places in 273 ms
[2020-06-03 05:33:50] [INFO ] Deduced a trap composed of 106 places in 274 ms
[2020-06-03 05:33:50] [INFO ] Deduced a trap composed of 24 places in 275 ms
[2020-06-03 05:33:50] [INFO ] Deduced a trap composed of 12 places in 270 ms
[2020-06-03 05:33:50] [INFO ] Deduced a trap composed of 121 places in 141 ms
[2020-06-03 05:33:51] [INFO ] Deduced a trap composed of 15 places in 131 ms
[2020-06-03 05:33:51] [INFO ] Deduced a trap composed of 28 places in 269 ms
[2020-06-03 05:33:51] [INFO ] Deduced a trap composed of 26 places in 268 ms
[2020-06-03 05:33:51] [INFO ] Deduced a trap composed of 31 places in 261 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 24 places in 244 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 29 places in 157 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 26 places in 124 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 123 places in 236 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 26 places in 123 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 28 places in 119 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 20 places in 124 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 20 places in 121 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 112 places in 123 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 37 places in 241 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 39 places in 164 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 37 places in 153 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 38 places in 142 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 106 places in 127 ms
[2020-06-03 05:33:55] [INFO ] Deduced a trap composed of 57 places in 274 ms
[2020-06-03 05:33:55] [INFO ] Deduced a trap composed of 41 places in 224 ms
[2020-06-03 05:33:57] [INFO ] Deduced a trap composed of 110 places in 2000 ms
[2020-06-03 05:33:57] [INFO ] Deduced a trap composed of 109 places in 137 ms
[2020-06-03 05:33:57] [INFO ] Deduced a trap composed of 123 places in 114 ms
[2020-06-03 05:33:58] [INFO ] Deduced a trap composed of 110 places in 1289 ms
[2020-06-03 05:33:59] [INFO ] Deduced a trap composed of 113 places in 242 ms
[2020-06-03 05:33:59] [INFO ] Deduced a trap composed of 106 places in 239 ms
[2020-06-03 05:33:59] [INFO ] Deduced a trap composed of 107 places in 236 ms
[2020-06-03 05:33:59] [INFO ] Deduced a trap composed of 64 places in 128 ms
[2020-06-03 05:34:00] [INFO ] Deduced a trap composed of 62 places in 125 ms
[2020-06-03 05:34:00] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 15102 ms
[2020-06-03 05:34:00] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 16 ms.
[2020-06-03 05:34:03] [INFO ] Added : 344 causal constraints over 69 iterations in 3631 ms. Result :sat
[2020-06-03 05:34:03] [INFO ] Deduced a trap composed of 131 places in 215 ms
[2020-06-03 05:34:03] [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 s5 s6 s60 s61 s62 s66 s67 s68 s75 s83 s105 s120 s121 s122 s134 s135 s139 s140 s141 s145 s154 s155 s171 s172 s173 s176 s177 s185 s191 s192 s193 s209 s210 s211 s218 s219 s220 s223 s224 s228 s229 s230 s270 s275 s293 s294 s295 s299 s309 s314 s319 s324 s329 s334 s339 s344 s349 s364 s369 s384 s389 s399 s404 s409 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s445 s446 s454 s456 s460 s463 s467 s468 s469 s470 s471 s478 s479 s490 s491 s492 s493 s498 s499 s502 s503 s517 s518 s519 s520 s521 s522 s523 s524 s529 s530 s543 s544 s548 s554 s566) 0)") while checking expression at index 8
[2020-06-03 05:34:04] [INFO ] [Real]Absence check using 55 positive place invariants in 53 ms returned sat
[2020-06-03 05:34:04] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 35 ms returned sat
[2020-06-03 05:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:05] [INFO ] [Real]Absence check using state equation in 1555 ms returned sat
[2020-06-03 05:34:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:06] [INFO ] [Nat]Absence check using 55 positive place invariants in 303 ms returned sat
[2020-06-03 05:34:06] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 69 ms returned sat
[2020-06-03 05:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:08] [INFO ] [Nat]Absence check using state equation in 2730 ms returned sat
[2020-06-03 05:34:14] [INFO ] Deduced a trap composed of 11 places in 6060 ms
[2020-06-03 05:34:15] [INFO ] Deduced a trap composed of 13 places in 161 ms
[2020-06-03 05:34:17] [INFO ] Deduced a trap composed of 16 places in 2651 ms
[2020-06-03 05:34:18] [INFO ] Deduced a trap composed of 32 places in 859 ms
[2020-06-03 05:34:20] [INFO ] Deduced a trap composed of 22 places in 2171 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 130 places in 288 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 14 places in 174 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 129 places in 170 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 11 places in 183 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 15 places in 155 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 136 places in 151 ms
[2020-06-03 05:34:23] [INFO ] Deduced a trap composed of 21 places in 1114 ms
[2020-06-03 05:34:24] [INFO ] Deduced a trap composed of 107 places in 286 ms
[2020-06-03 05:34:24] [INFO ] Deduced a trap composed of 19 places in 148 ms
[2020-06-03 05:34:24] [INFO ] Deduced a trap composed of 17 places in 362 ms
[2020-06-03 05:34:24] [INFO ] Deduced a trap composed of 20 places in 163 ms
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 26 places in 162 ms
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 35 places in 177 ms
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 33 places in 151 ms
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 132 places in 186 ms
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 21 places in 192 ms
[2020-06-03 05:34:25] [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 s223 s224 s240 s388 s389 s390 s394 s398 s399 s400 s404 s407 s409 s410 s411 s529 s530 s539 s540) 0)") while checking expression at index 9
[2020-06-03 05:34:26] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 05:34:26] [INFO ] Flatten gal took : 273 ms
[2020-06-03 05:34:26] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 05:34:26] [INFO ] Flatten gal took : 78 ms
FORMULA BusinessProcesses-PT-12-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:34:26] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 05:34:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BusinessProcesses-PT-12 @ 3570 seconds

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

FORMULA BusinessProcesses-PT-12-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-12-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-12-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA BusinessProcesses-PT-12-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3553
rslt: Output for CTLCardinality @ BusinessProcesses-PT-12

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((((p86 <= 0)) OR ((1 <= p143)))))",
"processed_size": 40,
"rewrites": 26
},
"result":
{
"edges": 1434,
"markings": 1148,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": "A (G ((((1 <= p523)) AND ((p310 <= 0)))))",
"processed_size": 41,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX((((1 <= p497)) AND ((2 <= p64) OR (p64 <= 0))))",
"processed_size": 51,
"rewrites": 25
},
"net":
{
"conflict_clusters": 437,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "EF(AX((((1 <= p216)) AND ((p325 <= 0)))))",
"processed_size": 41,
"rewrites": 26
},
"net":
{
"conflict_clusters": 437,
"singleton_clusters": 0
},
"result":
{
"edges": 358,
"markings": 355,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"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": "AG(EX((((p494 <= 0)) OR ((1 <= p162)))))",
"processed_size": 41,
"rewrites": 26
},
"net":
{
"conflict_clusters": 437,
"singleton_clusters": 0
},
"result":
{
"edges": 358,
"markings": 355,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F ((((1 <= p339)) AND ((p359 <= 0)))))",
"processed_size": 41,
"rewrites": 25
},
"result":
{
"edges": 158,
"markings": 159,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"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": "A (G (((((p178 <= 0)) OR ((1 <= p515))) AND (((p337 <= 0)) OR ((1 <= p174))))))",
"processed_size": 81,
"rewrites": 26
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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 <= p116)) AND ((p297 <= 0)))",
"processed_size": 33,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F ((((1 <= p163)) AND ((p411 <= 0)))))",
"processed_size": 41,
"rewrites": 25
},
"result":
{
"edges": 150,
"markings": 151,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"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 <= p498)) U (((p478 <= 0)) OR ((1 <= p94)))))",
"processed_size": 54,
"rewrites": 26
},
"result":
{
"edges": 3322308,
"markings": 573160,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1776
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((((p97 <= 0)) OR ((1 <= p218)))))",
"processed_size": 40,
"rewrites": 26
},
"result":
{
"edges": 1216,
"markings": 972,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3553
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F (((1 <= p219))))",
"processed_size": 21,
"rewrites": 25
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 29824,
"runtime": 17.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(**)) OR (A(X(*)) OR A(G(*)))) : E(F(A(X(*)))) : A(G(A((** U **)))) : (E(F(*)) AND A(G(**))) : E(F(*)) : A(G(**)) : (** OR E(F(*))) : A(G(E(X(**)))) : (E(F(A(G(**)))) OR E(F(**)))"
},
"net":
{
"arcs": 1552,
"conflict_clusters": 437,
"places": 582,
"places_significant": 484,
"singleton_clusters": 0,
"transitions": 521
},
"result":
{
"preliminary_value": "no yes no no yes no yes no yes ",
"value": "no yes no no yes no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 582
lola: finding significant places
lola: 582 places, 521 transitions, 484 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p310 <= 1)
lola: LP says that atomic proposition is always true: (p325 <= 1)
lola: LP says that atomic proposition is always true: (p498 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p359 <= 1)
lola: LP says that atomic proposition is always true: (p515 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p411 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: ((A (G ((((p86 <= 0)) OR ((1 <= p143))))) OR NOT(E (X ((((p497 <= 0)) OR ((p64 <= 1) AND (1 <= p64))))))) OR NOT(E (F ((((p523 <= 0)) OR ((1 <= p310))))))) : E (F (NOT(E (X ((((p216 <= 0)) OR ((1 <= p325)))))))) : A (G (A ((((1 <= p498)) U (((p478 <= 0)) OR ((1 <= p94))))))) : (NOT(A (G ((((1 <= p405)) OR ((p433 <= 0)) OR ((p30 <= 1) AND (1 <= p30)))))) AND A (G (A (G ((((p97 <= 0)) OR ((1 <= p218)))))))) : E (F (NOT(A (G ((((p339 <= 0)) OR ((1 <= p359)))))))) : A (G (((((p178 <= 0)) OR ((1 <= p515))) AND (((p337 <= 0)) OR ((1 <= p174)))))) : (A (((1 <= 0) U (((1 <= p116)) AND ((p297 <= 0))))) OR NOT(A (G ((((p163 <= 0)) OR ((1 <= p411))))))) : A (G (E (X ((((p494 <= 0)) OR ((1 <= p162))))))) : E (F ((A (G (((1 <= p388)))) OR ((1 <= p219)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p86 <= 0)) OR ((1 <= p143))))) OR (A (X ((((1 <= p497)) AND ((2 <= p64) OR (p64 <= 0))))) OR A (G ((((1 <= p523)) AND ((p310 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p86 <= 0)) OR ((1 <= p143)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p86 <= 0)) OR ((1 <= p143)))))
lola: processed formula length: 40
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p86)) AND ((p143 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1148 markings, 1434 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p523)) AND ((p310 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((1 <= p523)) AND ((p310 <= 0)))))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p497)) AND ((2 <= p64) OR (p64 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p497)) AND ((2 <= p64) OR (p64 <= 0))))
lola: processed formula length: 51
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((((1 <= p216)) AND ((p325 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((((1 <= p216)) AND ((p325 <= 0)))))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 355 markings, 358 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((((p494 <= 0)) OR ((1 <= p162)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((((p494 <= 0)) OR ((1 <= p162)))))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 355 markings, 358 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p339)) AND ((p359 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p339)) AND ((p359 <= 0)))))
lola: processed formula length: 41
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p339)) AND ((p359 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 159 markings, 158 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p178 <= 0)) OR ((1 <= p515))) AND (((p337 <= 0)) OR ((1 <= p174))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((((p178 <= 0)) OR ((1 <= p515))) AND (((p337 <= 0)) OR ((1 <= p174))))))
lola: processed formula length: 81
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p178)) AND ((p515 <= 0))) OR (((1 <= p337)) AND ((p174 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p116)) AND ((p297 <= 0))) OR E (F ((((1 <= p163)) AND ((p411 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p116)) AND ((p297 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p116)) AND ((p297 <= 0)))
lola: processed formula length: 33
lola: 24 rewrites
lola: closed formula file CTLCardinality.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 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p163)) AND ((p411 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p163)) AND ((p411 <= 0)))))
lola: processed formula length: 41
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 151 markings, 150 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A ((((1 <= p498)) U (((p478 <= 0)) OR ((1 <= p94)))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p498)) U (((p478 <= 0)) OR ((1 <= p94)))))
lola: processed formula length: 54
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: 175354 markings, 902878 edges, 35071 markings/sec, 0 secs
lola: 450043 markings, 2567154 edges, 54938 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 573160 markings, 3322308 edges
lola: ========================================
lola: subprocess 7 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((p405 <= 0)) AND ((1 <= p433)) AND ((2 <= p30) OR (p30 <= 0))))) AND A (G ((((p97 <= 0)) OR ((1 <= p218))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p97 <= 0)) OR ((1 <= p218)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p97 <= 0)) OR ((1 <= p218)))))
lola: processed formula length: 40
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p97)) AND ((p218 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 972 markings, 1216 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p388)))))) OR E (F (((1 <= p219)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p219))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p219))))
lola: processed formula length: 21
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no yes no yes
lola:
preliminary result: no yes no no yes no yes no yes
lola: memory consumption: 29824 KB
lola: time consumption: 17 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 1494508 kB
After kill :
MemTotal: 16427332 kB
MemFree: 1489964 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-12, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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