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-158987913900483.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-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:43 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.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 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 85K 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-05-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591157841447

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:17:23] [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 04:17:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:17:24] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2020-06-03 04:17:24] [INFO ] Transformed 368 places.
[2020-06-03 04:17:24] [INFO ] Transformed 319 transitions.
[2020-06-03 04:17:24] [INFO ] Found NUPN structural information;
[2020-06-03 04:17:24] [INFO ] Parsed PT model containing 368 places and 319 transitions in 158 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Incomplete random walk after 100000 steps, including 941 resets, run finished after 349 ms. (steps per millisecond=286 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2020-06-03 04:17:24] [INFO ] Computed 57 place invariants in 19 ms
[2020-06-03 04:17:24] [INFO ] [Real]Absence check using 41 positive place invariants in 84 ms returned sat
[2020-06-03 04:17:24] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-06-03 04:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:17:25] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2020-06-03 04:17:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:17:25] [INFO ] [Nat]Absence check using 41 positive place invariants in 49 ms returned sat
[2020-06-03 04:17:25] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2020-06-03 04:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:17:25] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-06-03 04:17:26] [INFO ] Deduced a trap composed of 10 places in 240 ms
[2020-06-03 04:17:26] [INFO ] Deduced a trap composed of 11 places in 340 ms
[2020-06-03 04:17:26] [INFO ] Deduced a trap composed of 12 places in 312 ms
[2020-06-03 04:17:27] [INFO ] Deduced a trap composed of 17 places in 1069 ms
[2020-06-03 04:17:28] [INFO ] Deduced a trap composed of 15 places in 105 ms
[2020-06-03 04:17:28] [INFO ] Deduced a trap composed of 12 places in 114 ms
[2020-06-03 04:17:28] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2020-06-03 04:17:28] [INFO ] Deduced a trap composed of 90 places in 149 ms
[2020-06-03 04:17:28] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2020-06-03 04:17:28] [INFO ] Deduced a trap composed of 15 places in 86 ms
[2020-06-03 04:17:28] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-06-03 04:17:28] [INFO ] Deduced a trap composed of 25 places in 83 ms
[2020-06-03 04:17:29] [INFO ] Deduced a trap composed of 92 places in 109 ms
[2020-06-03 04:17:29] [INFO ] Deduced a trap composed of 20 places in 110 ms
[2020-06-03 04:17:29] [INFO ] Deduced a trap composed of 16 places in 117 ms
[2020-06-03 04:17:29] [INFO ] Deduced a trap composed of 91 places in 102 ms
[2020-06-03 04:17:29] [INFO ] Deduced a trap composed of 87 places in 125 ms
[2020-06-03 04:17:29] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-06-03 04:17:29] [INFO ] Deduced a trap composed of 93 places in 111 ms
[2020-06-03 04:17:29] [INFO ] Deduced a trap composed of 17 places in 103 ms
[2020-06-03 04:17:30] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2020-06-03 04:17:30] [INFO ] Deduced a trap composed of 94 places in 95 ms
[2020-06-03 04:17:30] [INFO ] Deduced a trap composed of 88 places in 97 ms
[2020-06-03 04:17:30] [INFO ] Deduced a trap composed of 95 places in 104 ms
[2020-06-03 04:17:30] [INFO ] Deduced a trap composed of 93 places in 117 ms
[2020-06-03 04:17:30] [INFO ] Deduced a trap composed of 27 places in 104 ms
[2020-06-03 04:17:31] [INFO ] Deduced a trap composed of 92 places in 808 ms
[2020-06-03 04:17:32] [INFO ] Deduced a trap composed of 23 places in 1114 ms
[2020-06-03 04:17:32] [INFO ] Deduced a trap composed of 86 places in 204 ms
[2020-06-03 04:17:32] [INFO ] Deduced a trap composed of 94 places in 88 ms
[2020-06-03 04:17:33] [INFO ] Deduced a trap composed of 88 places in 87 ms
[2020-06-03 04:17:33] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2020-06-03 04:17:33] [INFO ] Deduced a trap composed of 93 places in 72 ms
[2020-06-03 04:17:33] [INFO ] Deduced a trap composed of 18 places in 220 ms
[2020-06-03 04:17:33] [INFO ] Deduced a trap composed of 25 places in 118 ms
[2020-06-03 04:17:33] [INFO ] Deduced a trap composed of 27 places in 95 ms
[2020-06-03 04:17:33] [INFO ] Deduced a trap composed of 29 places in 90 ms
[2020-06-03 04:17:33] [INFO ] Deduced a trap composed of 36 places in 92 ms
[2020-06-03 04:17:34] [INFO ] Deduced a trap composed of 21 places in 77 ms
[2020-06-03 04:17:34] [INFO ] Deduced a trap composed of 29 places in 287 ms
[2020-06-03 04:17:34] [INFO ] Deduced a trap composed of 95 places in 126 ms
[2020-06-03 04:17:34] [INFO ] Deduced a trap composed of 90 places in 150 ms
[2020-06-03 04:17:34] [INFO ] Deduced a trap composed of 102 places in 171 ms
[2020-06-03 04:17:34] [INFO ] Deduced a trap composed of 90 places in 81 ms
[2020-06-03 04:17:35] [INFO ] Deduced a trap composed of 97 places in 150 ms
[2020-06-03 04:17:35] [INFO ] Deduced a trap composed of 87 places in 103 ms
[2020-06-03 04:17:35] [INFO ] Deduced a trap composed of 90 places in 119 ms
[2020-06-03 04:17:35] [INFO ] Deduced a trap composed of 84 places in 141 ms
[2020-06-03 04:17:35] [INFO ] Deduced a trap composed of 95 places in 87 ms
[2020-06-03 04:17:35] [INFO ] Deduced a trap composed of 40 places in 76 ms
[2020-06-03 04:17:35] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2020-06-03 04:17:35] [INFO ] Deduced a trap composed of 27 places in 76 ms
[2020-06-03 04:17:36] [INFO ] Deduced a trap composed of 99 places in 124 ms
[2020-06-03 04:17:36] [INFO ] Deduced a trap composed of 95 places in 107 ms
[2020-06-03 04:17:36] [INFO ] Deduced a trap composed of 92 places in 98 ms
[2020-06-03 04:17:36] [INFO ] Deduced a trap composed of 94 places in 89 ms
[2020-06-03 04:17:36] [INFO ] Deduced a trap composed of 98 places in 78 ms
[2020-06-03 04:17:36] [INFO ] Deduced a trap composed of 97 places in 76 ms
[2020-06-03 04:17:36] [INFO ] Deduced a trap composed of 94 places in 81 ms
[2020-06-03 04:17:36] [INFO ] Deduced a trap composed of 95 places in 112 ms
[2020-06-03 04:17:37] [INFO ] Deduced a trap composed of 105 places in 131 ms
[2020-06-03 04:17:37] [INFO ] Deduced a trap composed of 94 places in 118 ms
[2020-06-03 04:17:37] [INFO ] Deduced a trap composed of 95 places in 86 ms
[2020-06-03 04:17:37] [INFO ] Deduced a trap composed of 93 places in 82 ms
[2020-06-03 04:17:37] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 11618 ms
[2020-06-03 04:17:37] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 49 ms.
[2020-06-03 04:17:38] [INFO ] Added : 179 causal constraints over 36 iterations in 1317 ms. Result :sat
[2020-06-03 04:17:38] [INFO ] Deduced a trap composed of 88 places in 188 ms
[2020-06-03 04:17:39] [INFO ] Deduced a trap composed of 93 places in 166 ms
[2020-06-03 04:17:39] [INFO ] Deduced a trap composed of 97 places in 142 ms
[2020-06-03 04:17:39] [INFO ] Deduced a trap composed of 92 places in 143 ms
[2020-06-03 04:17:39] [INFO ] Deduced a trap composed of 90 places in 97 ms
[2020-06-03 04:17:39] [INFO ] Deduced a trap composed of 89 places in 140 ms
[2020-06-03 04:17:40] [INFO ] Deduced a trap composed of 91 places in 193 ms
[2020-06-03 04:17:40] [INFO ] Deduced a trap composed of 91 places in 83 ms
[2020-06-03 04:17:40] [INFO ] Deduced a trap composed of 90 places in 89 ms
[2020-06-03 04:17:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1750 ms
[2020-06-03 04:17:40] [INFO ] [Real]Absence check using 41 positive place invariants in 47 ms returned sat
[2020-06-03 04:17:40] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-06-03 04:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:17:42] [INFO ] [Real]Absence check using state equation in 1915 ms returned sat
[2020-06-03 04:17:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:17:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 57 ms returned sat
[2020-06-03 04:17:42] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-06-03 04:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:17:43] [INFO ] [Nat]Absence check using state equation in 716 ms returned unsat
[2020-06-03 04:17:43] [INFO ] [Real]Absence check using 41 positive place invariants in 104 ms returned sat
[2020-06-03 04:17:43] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 109 ms returned sat
[2020-06-03 04:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:17:44] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2020-06-03 04:17:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:17:45] [INFO ] [Nat]Absence check using 41 positive place invariants in 221 ms returned sat
[2020-06-03 04:17:45] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 76 ms returned sat
[2020-06-03 04:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:17:46] [INFO ] [Nat]Absence check using state equation in 1580 ms returned sat
[2020-06-03 04:17:48] [INFO ] Deduced a trap composed of 13 places in 2007 ms
[2020-06-03 04:17:48] [INFO ] Deduced a trap composed of 14 places in 115 ms
[2020-06-03 04:17:49] [INFO ] Deduced a trap composed of 10 places in 226 ms
[2020-06-03 04:17:49] [INFO ] Deduced a trap composed of 15 places in 219 ms
[2020-06-03 04:17:49] [INFO ] Deduced a trap composed of 8 places in 175 ms
[2020-06-03 04:17:49] [INFO ] Deduced a trap composed of 20 places in 206 ms
[2020-06-03 04:17:50] [INFO ] Deduced a trap composed of 17 places in 197 ms
[2020-06-03 04:17:50] [INFO ] Deduced a trap composed of 20 places in 192 ms
[2020-06-03 04:17:50] [INFO ] Deduced a trap composed of 87 places in 503 ms
[2020-06-03 04:17:51] [INFO ] Deduced a trap composed of 23 places in 1029 ms
[2020-06-03 04:17:52] [INFO ] Deduced a trap composed of 18 places in 188 ms
[2020-06-03 04:17:52] [INFO ] Deduced a trap composed of 26 places in 155 ms
[2020-06-03 04:17:52] [INFO ] Deduced a trap composed of 92 places in 127 ms
[2020-06-03 04:17:52] [INFO ] Deduced a trap composed of 35 places in 208 ms
[2020-06-03 04:17:52] [INFO ] Deduced a trap composed of 82 places in 182 ms
[2020-06-03 04:17:53] [INFO ] Deduced a trap composed of 27 places in 181 ms
[2020-06-03 04:17:53] [INFO ] Deduced a trap composed of 33 places in 458 ms
[2020-06-03 04:17:53] [INFO ] Deduced a trap composed of 90 places in 208 ms
[2020-06-03 04:17:54] [INFO ] Deduced a trap composed of 19 places in 654 ms
[2020-06-03 04:17:54] [INFO ] Deduced a trap composed of 15 places in 145 ms
[2020-06-03 04:17:54] [INFO ] Deduced a trap composed of 29 places in 158 ms
[2020-06-03 04:17:55] [INFO ] Deduced a trap composed of 40 places in 226 ms
[2020-06-03 04:17:55] [INFO ] Deduced a trap composed of 99 places in 164 ms
[2020-06-03 04:17:55] [INFO ] Deduced a trap composed of 12 places in 289 ms
[2020-06-03 04:17:55] [INFO ] Deduced a trap composed of 96 places in 93 ms
[2020-06-03 04:17:55] [INFO ] Deduced a trap composed of 95 places in 203 ms
[2020-06-03 04:18:01] [INFO ] Deduced a trap composed of 34 places in 5864 ms
[2020-06-03 04:18:04] [INFO ] Deduced a trap composed of 90 places in 3147 ms
[2020-06-03 04:18:04] [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 s22 s23 s24 s30 s31 s33 s34 s37 s38 s44 s45 s47 s48 s51 s56 s57 s58 s73 s74 s75 s81 s82 s124 s125 s126 s131 s134 s158 s173 s183 s188 s198 s208 s213 s233 s237 s238 s239 s243 s252 s253 s254 s257 s258 s259 s263 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s281 s282 s283 s284 s289 s290 s304 s305 s306 s307 s308 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s338 s339 s342 s343 s350 s351 s358 s359 s366) 0)") while checking expression at index 2
[2020-06-03 04:18:05] [INFO ] [Real]Absence check using 41 positive place invariants in 239 ms returned sat
[2020-06-03 04:18:05] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 105 ms returned sat
[2020-06-03 04:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:18:08] [INFO ] [Real]Absence check using state equation in 3122 ms returned sat
[2020-06-03 04:18:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:18:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 338 ms returned sat
[2020-06-03 04:18:09] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 105 ms returned sat
[2020-06-03 04:18:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:18:12] [INFO ] [Nat]Absence check using state equation in 3206 ms returned sat
[2020-06-03 04:18:15] [INFO ] Deduced a trap composed of 16 places in 3443 ms
[2020-06-03 04:18:16] [INFO ] Deduced a trap composed of 93 places in 1190 ms
[2020-06-03 04:18:17] [INFO ] Deduced a trap composed of 10 places in 166 ms
[2020-06-03 04:18:17] [INFO ] Deduced a trap composed of 26 places in 122 ms
[2020-06-03 04:18:17] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-06-03 04:18:17] [INFO ] Deduced a trap composed of 8 places in 167 ms
[2020-06-03 04:18:17] [INFO ] Deduced a trap composed of 28 places in 103 ms
[2020-06-03 04:18:17] [INFO ] Deduced a trap composed of 18 places in 79 ms
[2020-06-03 04:18:18] [INFO ] Deduced a trap composed of 24 places in 897 ms
[2020-06-03 04:18:18] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2020-06-03 04:18:18] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2020-06-03 04:18:18] [INFO ] Deduced a trap composed of 95 places in 95 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 92 places in 93 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 18 places in 47 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 25 places in 49 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 29 places in 47 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2020-06-03 04:18:19] [INFO ] Deduced a trap composed of 18 places in 34 ms
[2020-06-03 04:18:19] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7530 ms
[2020-06-03 04:18:19] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 17 ms.
[2020-06-03 04:18:20] [INFO ] Added : 182 causal constraints over 37 iterations in 786 ms. Result :sat
[2020-06-03 04:18:20] [INFO ] [Real]Absence check using 41 positive place invariants in 29 ms returned sat
[2020-06-03 04:18:20] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2020-06-03 04:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:18:21] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-06-03 04:18:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:18:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 54 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 04:18:21] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 04:18:21] [INFO ] Flatten gal took : 57 ms
[2020-06-03 04:18:21] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 04:18:21] [INFO ] Flatten gal took : 20 ms
FORMULA BusinessProcesses-PT-05-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:18:21] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 04:18:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BusinessProcesses-PT-05 @ 3570 seconds

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

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

FORMULA BusinessProcesses-PT-05-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-05-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA BusinessProcesses-PT-05-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3554
rslt: Output for CTLCardinality @ BusinessProcesses-PT-05

{
"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 04:18:21 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": 6,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p189 <= 0)) OR ((1 <= p47)) OR ((p353 <= 0)) OR ((1 <= p297)) OR ((p212 <= 0)) OR ((1 <= p218)))))",
"processed_size": 112,
"rewrites": 11
},
"result":
{
"edges": 95,
"markings": 96,
"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": 6,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 89,
"markings": 90,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "nodeadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p25))))",
"processed_size": 20,
"rewrites": 10
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 ((((p296 <= 0)) OR ((1 <= p101)))))",
"processed_size": 41,
"rewrites": 11
},
"result":
{
"edges": 57,
"markings": 58,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F (((1 <= p155) AND (((p353 <= 0)) OR ((1 <= p194))))))",
"processed_size": 59,
"rewrites": 10
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "E (F ((((p19 <= 0)) AND ((1 <= p349)) AND ((p69 <= 0)))))",
"processed_size": 57,
"rewrites": 10
},
"result":
{
"edges": 268,
"markings": 233,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p295 <= 0)) OR ((1 <= p198)) OR ((p109 <= 0)) OR ((1 <= p300)))))",
"processed_size": 77,
"rewrites": 11
},
"result":
{
"edges": 60,
"markings": 61,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"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": "A(EF((((p120 <= 0)) OR ((1 <= p82)))) U AG((((p320 <= 0)) OR ((1 <= p351)))))",
"processed_size": 79,
"rewrites": 12
},
"net":
{
"conflict_clusters": 289,
"singleton_clusters": 0
},
"result":
{
"edges": 6143387,
"markings": 805812,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3554
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p282 <= 0)) OR ((1 <= p82)))",
"processed_size": 32,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"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": 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": "(((p282 <= 0)) OR ((1 <= p82)))",
"processed_size": 32,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((((p19 <= 0)) OR ((1 <= p68))) AND (((p184 <= 0)) OR ((1 <= p303))) AND (((p321 <= 0)) OR ((1 <= p275))) AND (((p213 <= 0)) OR ((1 <= p357))))))",
"processed_size": 155,
"rewrites": 11
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 30668,
"runtime": 16.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : (A(G(**)) AND A(X(**))) : E(F(**)) : A(G(**)) : A(G(**)) : (A(G(**)) AND **) : A(G(NODEADLOCK)) : E(F(*)) : A((E(F(**)) U A(G(**))))"
},
"net":
{
"arcs": 852,
"conflict_clusters": 289,
"places": 367,
"places_significant": 310,
"singleton_clusters": 0,
"transitions": 318
},
"result":
{
"preliminary_value": "yes no yes no no no no yes no ",
"value": "yes no yes no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 685/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 367
lola: finding significant places
lola: 367 places, 318 transitions, 310 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: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p357 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: E (F (A (F (((1 <= p155) AND (((p353 <= 0)) OR ((1 <= p194)))))))) : (A (G ((((p189 <= 0)) OR ((1 <= p47)) OR ((p353 <= 0)) OR ((1 <= p297)) OR ((p212 <= 0)) OR ((1 <= p218))))) AND A (X (((p134 <= 0))))) : E ((A (X ((((p31 <= 0)) OR ((1 <= p101))))) U E (F (((1 <= p25)))))) : A (G (E (G ((((p295 <= 0)) OR ((1 <= p198)) OR ((p109 <= 0)) OR ((1 <= p300))))))) : A (G (E (G ((((p296 <= 0)) OR ((1 <= p101))))))) : (A (G (((((p19 <= 0)) OR ((1 <= p68))) AND (((p184 <= 0)) OR ((1 <= p303))) AND (((p321 <= 0)) OR ((1 <= p275))) AND (((p213 <= 0)) OR ((1 <= p357)))))) AND (((p282 <= 0)) OR ((1 <= p82)))) : A (G (E (X ((0 <= 0))))) : NOT(A (G ((((1 <= p19)) OR ((p349 <= 0)) OR ((1 <= p69)))))) : A ((E (F ((((p120 <= 0)) OR ((1 <= p82))))) U A (G ((((p320 <= 0)) OR ((1 <= p351)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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: 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 ((((p189 <= 0)) OR ((1 <= p47)) OR ((p353 <= 0)) OR ((1 <= p297)) OR ((p212 <= 0)) OR ((1 <= p218))))) AND A (X (((p134 <= 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 ((((p189 <= 0)) OR ((1 <= p47)) OR ((p353 <= 0)) OR ((1 <= p297)) OR ((p212 <= 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 ((((p189 <= 0)) OR ((1 <= p47)) OR ((p353 <= 0)) OR ((1 <= p297)) OR ((p212 <= 0)) OR ((1 <= p218)))))
lola: processed formula length: 112
lola: 11 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 <= p189)) AND ((p47 <= 0)) AND ((1 <= p353)) AND ((p297 <= 0)) AND ((1 <= p212)) AND ((p218 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 96 markings, 95 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: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net is not deadlock-free.
lola: 90 markings, 89 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p25))))
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 <= p25))))
lola: processed formula length: 20
lola: 10 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 <= p25))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p296 <= 0)) OR ((1 <= p101)))))
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 ((((p296 <= 0)) OR ((1 <= p101)))))
lola: processed formula length: 41
lola: 11 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 <= p296)) AND ((p101 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 58 markings, 57 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p155) AND (((p353 <= 0)) OR ((1 <= p194))))))
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 <= p155) AND (((p353 <= 0)) OR ((1 <= p194))))))
lola: processed formula length: 59
lola: 10 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: 23 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p19 <= 0)) AND ((1 <= p349)) AND ((p69 <= 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 ((((p19 <= 0)) AND ((1 <= p349)) AND ((p69 <= 0)))))
lola: processed formula length: 57
lola: 10 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: (((p19 <= 0)) AND ((1 <= p349)) AND ((p69 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 233 markings, 268 edges
lola: ========================================
lola: subprocess 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p295 <= 0)) OR ((1 <= p198)) OR ((p109 <= 0)) OR ((1 <= p300)))))
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 ((((p295 <= 0)) OR ((1 <= p198)) OR ((p109 <= 0)) OR ((1 <= p300)))))
lola: processed formula length: 77
lola: 11 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 <= p295)) AND ((p198 <= 0)) AND ((1 <= p109)) AND ((p300 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((((p120 <= 0)) OR ((1 <= p82))))) U A (G ((((p320 <= 0)) OR ((1 <= p351)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EF((((p120 <= 0)) OR ((1 <= p82)))) U AG((((p320 <= 0)) OR ((1 <= p351)))))
lola: processed formula length: 79
lola: 12 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 356754 markings, 2634641 edges, 71351 markings/sec, 0 secs
lola: 691273 markings, 5234607 edges, 66904 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 805812 markings, 6143387 edges
lola: ========================================
lola: subprocess 8 will run for 3554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((((p19 <= 0)) OR ((1 <= p68))) AND (((p184 <= 0)) OR ((1 <= p303))) AND (((p321 <= 0)) OR ((1 <= p275))) AND (((p213 <= 0)) OR ((1 <= p357)))))) AND (((p282 <= 0)) OR ((1 <= p82))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p282 <= 0)) OR ((1 <= p82)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p282 <= 0)) OR ((1 <= p82)))
lola: processed formula length: 32
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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: (A (G (((((p19 <= 0)) OR ((1 <= p68))) AND (((p184 <= 0)) OR ((1 <= p303))) AND (((p321 <= 0)) OR ((1 <= p275))) AND (((p213 <= 0)) OR ((1 <= p357)))))) AND (((p282 <= 0)) OR ((1 <= p82))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p282 <= 0)) OR ((1 <= p82)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p282 <= 0)) OR ((1 <= p82)))
lola: processed formula length: 32
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((((p19 <= 0)) OR ((1 <= p68))) AND (((p184 <= 0)) OR ((1 <= p303))) AND (((p321 <= 0)) OR ((1 <= p275))) AND (((p213 <= 0)) OR ((1 <= p357))))))
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 (((((p19 <= 0)) OR ((1 <= p68))) AND (((p184 <= 0)) OR ((1 <= p303))) AND (((p321 <= 0)) OR ((1 <= p275))) AND (((p213 <= 0)) OR ((1 <= p357))))))
lola: processed formula length: 155
lola: 11 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: 21 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no no yes no
lola:
preliminary result: yes no yes no no no no yes no
lola: memory consumption: 30668 KB
lola: time consumption: 16 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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-05"
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-05, 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-158987913900483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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