Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900100331.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-60b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900100331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 139K 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 DES-PT-60b-CTLCardinality-00
FORMULA_NAME DES-PT-60b-CTLCardinality-01
FORMULA_NAME DES-PT-60b-CTLCardinality-02
FORMULA_NAME DES-PT-60b-CTLCardinality-03
FORMULA_NAME DES-PT-60b-CTLCardinality-04
FORMULA_NAME DES-PT-60b-CTLCardinality-05
FORMULA_NAME DES-PT-60b-CTLCardinality-06
FORMULA_NAME DES-PT-60b-CTLCardinality-07
FORMULA_NAME DES-PT-60b-CTLCardinality-08
FORMULA_NAME DES-PT-60b-CTLCardinality-09
FORMULA_NAME DES-PT-60b-CTLCardinality-10
FORMULA_NAME DES-PT-60b-CTLCardinality-11
FORMULA_NAME DES-PT-60b-CTLCardinality-12
FORMULA_NAME DES-PT-60b-CTLCardinality-13
FORMULA_NAME DES-PT-60b-CTLCardinality-14
FORMULA_NAME DES-PT-60b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591201758640

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:29:21] [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 16:29:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:29:22] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2020-06-03 16:29:22] [INFO ] Transformed 519 places.
[2020-06-03 16:29:22] [INFO ] Transformed 470 transitions.
[2020-06-03 16:29:22] [INFO ] Found NUPN structural information;
[2020-06-03 16:29:22] [INFO ] Parsed PT model containing 519 places and 470 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 71 ms.
Incomplete random walk after 100000 steps, including 838 resets, run finished after 604 ms. (steps per millisecond=165 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0]
// Phase 1: matrix 470 rows 519 cols
[2020-06-03 16:29:22] [INFO ] Computed 65 place invariants in 77 ms
[2020-06-03 16:29:23] [INFO ] [Real]Absence check using 39 positive place invariants in 77 ms returned sat
[2020-06-03 16:29:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:29:24] [INFO ] [Real]Absence check using state equation in 1473 ms returned sat
[2020-06-03 16:29:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:29:25] [INFO ] [Nat]Absence check using 39 positive place invariants in 90 ms returned sat
[2020-06-03 16:29:25] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 85 ms returned sat
[2020-06-03 16:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:29:26] [INFO ] [Nat]Absence check using state equation in 1568 ms returned sat
[2020-06-03 16:29:27] [INFO ] Deduced a trap composed of 8 places in 413 ms
[2020-06-03 16:29:27] [INFO ] Deduced a trap composed of 12 places in 308 ms
[2020-06-03 16:29:28] [INFO ] Deduced a trap composed of 30 places in 151 ms
[2020-06-03 16:29:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1249 ms
[2020-06-03 16:29:28] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 58 ms.
[2020-06-03 16:29:35] [INFO ] Added : 441 causal constraints over 89 iterations in 7863 ms. Result :sat
[2020-06-03 16:29:36] [INFO ] Deduced a trap composed of 31 places in 292 ms
[2020-06-03 16:29:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2020-06-03 16:29:36] [INFO ] [Real]Absence check using 39 positive place invariants in 57 ms returned sat
[2020-06-03 16:29:36] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:29:38] [INFO ] [Real]Absence check using state equation in 1477 ms returned sat
[2020-06-03 16:29:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:29:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 76 ms returned sat
[2020-06-03 16:29:38] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 76 ms returned sat
[2020-06-03 16:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:29:39] [INFO ] [Nat]Absence check using state equation in 1378 ms returned sat
[2020-06-03 16:29:40] [INFO ] Deduced a trap composed of 12 places in 317 ms
[2020-06-03 16:29:40] [INFO ] Deduced a trap composed of 42 places in 270 ms
[2020-06-03 16:29:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 742 ms
[2020-06-03 16:29:40] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 88 ms.
[2020-06-03 16:29:45] [INFO ] Added : 254 causal constraints over 52 iterations in 5029 ms. Result :sat
[2020-06-03 16:29:45] [INFO ] Deduced a trap composed of 50 places in 291 ms
[2020-06-03 16:29:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2020-06-03 16:29:46] [INFO ] [Real]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-06-03 16:29:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:29:47] [INFO ] [Real]Absence check using state equation in 1572 ms returned sat
[2020-06-03 16:29:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:29:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 91 ms returned sat
[2020-06-03 16:29:48] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 89 ms returned sat
[2020-06-03 16:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:29:50] [INFO ] [Nat]Absence check using state equation in 1920 ms returned sat
[2020-06-03 16:29:50] [INFO ] Deduced a trap composed of 8 places in 379 ms
[2020-06-03 16:29:50] [INFO ] Deduced a trap composed of 13 places in 316 ms
[2020-06-03 16:29:51] [INFO ] Deduced a trap composed of 13 places in 291 ms
[2020-06-03 16:29:51] [INFO ] Deduced a trap composed of 20 places in 316 ms
[2020-06-03 16:29:52] [INFO ] Deduced a trap composed of 12 places in 323 ms
[2020-06-03 16:29:52] [INFO ] Deduced a trap composed of 18 places in 273 ms
[2020-06-03 16:29:52] [INFO ] Deduced a trap composed of 31 places in 245 ms
[2020-06-03 16:29:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2837 ms
[2020-06-03 16:29:53] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 54 ms.
[2020-06-03 16:30:03] [INFO ] Added : 461 causal constraints over 93 iterations in 10515 ms. Result :sat
[2020-06-03 16:30:03] [INFO ] Deduced a trap composed of 37 places in 251 ms
[2020-06-03 16:30:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2020-06-03 16:30:04] [INFO ] [Real]Absence check using 39 positive place invariants in 57 ms returned sat
[2020-06-03 16:30:04] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-06-03 16:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:30:05] [INFO ] [Real]Absence check using state equation in 1618 ms returned sat
[2020-06-03 16:30:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:30:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 82 ms returned sat
[2020-06-03 16:30:06] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 114 ms returned sat
[2020-06-03 16:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:30:08] [INFO ] [Nat]Absence check using state equation in 1909 ms returned sat
[2020-06-03 16:30:08] [INFO ] Deduced a trap composed of 19 places in 321 ms
[2020-06-03 16:30:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2020-06-03 16:30:08] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 56 ms.
[2020-06-03 16:30:17] [INFO ] Added : 315 causal constraints over 64 iterations in 8747 ms. Result :sat
[2020-06-03 16:30:17] [INFO ] Deduced a trap composed of 58 places in 345 ms
[2020-06-03 16:30:18] [INFO ] Deduced a trap composed of 56 places in 320 ms
[2020-06-03 16:30:18] [INFO ] Deduced a trap composed of 68 places in 377 ms
[2020-06-03 16:30:19] [INFO ] Deduced a trap composed of 38 places in 466 ms
[2020-06-03 16:30:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2135 ms
[2020-06-03 16:30:19] [INFO ] [Real]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-06-03 16:30:19] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:30:21] [INFO ] [Real]Absence check using state equation in 1650 ms returned sat
[2020-06-03 16:30:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:30:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 96 ms returned sat
[2020-06-03 16:30:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 147 ms returned sat
[2020-06-03 16:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:30:26] [INFO ] [Nat]Absence check using state equation in 5083 ms returned sat
[2020-06-03 16:30:27] [INFO ] Deduced a trap composed of 24 places in 419 ms
[2020-06-03 16:30:27] [INFO ] Deduced a trap composed of 10 places in 324 ms
[2020-06-03 16:30:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 876 ms
[2020-06-03 16:30:27] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 45 ms.
[2020-06-03 16:30:36] [INFO ] Added : 367 causal constraints over 75 iterations in 8509 ms. Result :sat
[2020-06-03 16:30:36] [INFO ] Deduced a trap composed of 55 places in 227 ms
[2020-06-03 16:30:36] [INFO ] Deduced a trap composed of 53 places in 196 ms
[2020-06-03 16:30:37] [INFO ] Deduced a trap composed of 27 places in 354 ms
[2020-06-03 16:30:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1314 ms
[2020-06-03 16:30:37] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 16:30:37] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-06-03 16:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:30:39] [INFO ] [Real]Absence check using state equation in 1616 ms returned sat
[2020-06-03 16:30:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:30:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 92 ms returned sat
[2020-06-03 16:30:39] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 65 ms returned sat
[2020-06-03 16:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:30:41] [INFO ] [Nat]Absence check using state equation in 1440 ms returned sat
[2020-06-03 16:30:41] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 85 ms.
[2020-06-03 16:30:48] [INFO ] Added : 383 causal constraints over 78 iterations in 6982 ms. Result :sat
[2020-06-03 16:30:48] [INFO ] Deduced a trap composed of 42 places in 319 ms
[2020-06-03 16:30:48] [INFO ] Deduced a trap composed of 55 places in 351 ms
[2020-06-03 16:30:49] [INFO ] Deduced a trap composed of 64 places in 379 ms
[2020-06-03 16:30:49] [INFO ] Deduced a trap composed of 55 places in 346 ms
[2020-06-03 16:30:50] [INFO ] Deduced a trap composed of 49 places in 306 ms
[2020-06-03 16:30:50] [INFO ] Deduced a trap composed of 49 places in 245 ms
[2020-06-03 16:30:50] [INFO ] Deduced a trap composed of 30 places in 145 ms
[2020-06-03 16:30:51] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-06-03 16:30:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3012 ms
[2020-06-03 16:30:51] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:30:51] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-06-03 16:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:30:53] [INFO ] [Real]Absence check using state equation in 1615 ms returned sat
[2020-06-03 16:30:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:30:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 93 ms returned sat
[2020-06-03 16:30:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 154 ms returned sat
[2020-06-03 16:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:30:55] [INFO ] [Nat]Absence check using state equation in 1801 ms returned sat
[2020-06-03 16:30:55] [INFO ] Deduced a trap composed of 48 places in 356 ms
[2020-06-03 16:30:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2020-06-03 16:30:55] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 76 ms.
[2020-06-03 16:31:04] [INFO ] Added : 407 causal constraints over 83 iterations in 9040 ms. Result :sat
[2020-06-03 16:31:04] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 16:31:05] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 68 ms returned sat
[2020-06-03 16:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:31:06] [INFO ] [Real]Absence check using state equation in 1476 ms returned sat
[2020-06-03 16:31:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:31:06] [INFO ] [Nat]Absence check using 39 positive place invariants in 97 ms returned sat
[2020-06-03 16:31:06] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 68 ms returned sat
[2020-06-03 16:31:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:31:09] [INFO ] [Nat]Absence check using state equation in 2327 ms returned sat
[2020-06-03 16:31:09] [INFO ] Deduced a trap composed of 13 places in 292 ms
[2020-06-03 16:31:09] [INFO ] Deduced a trap composed of 8 places in 261 ms
[2020-06-03 16:31:10] [INFO ] Deduced a trap composed of 12 places in 307 ms
[2020-06-03 16:31:10] [INFO ] Deduced a trap composed of 10 places in 222 ms
[2020-06-03 16:31:10] [INFO ] Deduced a trap composed of 14 places in 149 ms
[2020-06-03 16:31:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1799 ms
[2020-06-03 16:31:11] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 55 ms.
[2020-06-03 16:31:16] [INFO ] Added : 364 causal constraints over 74 iterations in 5968 ms. Result :sat
[2020-06-03 16:31:17] [INFO ] Deduced a trap composed of 56 places in 298 ms
[2020-06-03 16:31:17] [INFO ] Deduced a trap composed of 60 places in 221 ms
[2020-06-03 16:31:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 740 ms
[2020-06-03 16:31:17] [INFO ] [Real]Absence check using 39 positive place invariants in 51 ms returned sat
[2020-06-03 16:31:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 56 ms returned sat
[2020-06-03 16:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:31:19] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2020-06-03 16:31:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:31:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 72 ms returned sat
[2020-06-03 16:31:19] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 118 ms returned sat
[2020-06-03 16:31:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:31:21] [INFO ] [Nat]Absence check using state equation in 1953 ms returned sat
[2020-06-03 16:31:22] [INFO ] Deduced a trap composed of 12 places in 305 ms
[2020-06-03 16:31:22] [INFO ] Deduced a trap composed of 8 places in 248 ms
[2020-06-03 16:31:22] [INFO ] Deduced a trap composed of 20 places in 167 ms
[2020-06-03 16:31:22] [INFO ] Deduced a trap composed of 24 places in 161 ms
[2020-06-03 16:31:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1128 ms
[2020-06-03 16:31:22] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 48 ms.
[2020-06-03 16:31:29] [INFO ] Added : 294 causal constraints over 60 iterations in 6348 ms. Result :sat
[2020-06-03 16:31:29] [INFO ] Deduced a trap composed of 42 places in 335 ms
[2020-06-03 16:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2020-06-03 16:31:29] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:31:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 56 ms returned sat
[2020-06-03 16:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:31:31] [INFO ] [Real]Absence check using state equation in 1620 ms returned sat
[2020-06-03 16:31:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:31:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 82 ms returned sat
[2020-06-03 16:31:31] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 98 ms returned sat
[2020-06-03 16:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:31:34] [INFO ] [Nat]Absence check using state equation in 2156 ms returned sat
[2020-06-03 16:31:34] [INFO ] Deduced a trap composed of 21 places in 251 ms
[2020-06-03 16:31:34] [INFO ] Deduced a trap composed of 67 places in 253 ms
[2020-06-03 16:31:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 640 ms
[2020-06-03 16:31:34] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 48 ms.
[2020-06-03 16:31:42] [INFO ] Added : 375 causal constraints over 75 iterations in 7880 ms. Result :sat
[2020-06-03 16:31:42] [INFO ] Deduced a trap composed of 42 places in 304 ms
[2020-06-03 16:31:43] [INFO ] Deduced a trap composed of 58 places in 263 ms
[2020-06-03 16:31:43] [INFO ] Deduced a trap composed of 42 places in 331 ms
[2020-06-03 16:31:44] [INFO ] Deduced a trap composed of 31 places in 378 ms
[2020-06-03 16:31:44] [INFO ] Deduced a trap composed of 22 places in 371 ms
[2020-06-03 16:31:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2276 ms
[2020-06-03 16:31:45] [INFO ] [Real]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-06-03 16:31:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 16:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:31:46] [INFO ] [Real]Absence check using state equation in 1513 ms returned sat
[2020-06-03 16:31:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:31:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 92 ms returned sat
[2020-06-03 16:31:46] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 94 ms returned sat
[2020-06-03 16:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:31:48] [INFO ] [Nat]Absence check using state equation in 1551 ms returned sat
[2020-06-03 16:31:48] [INFO ] Deduced a trap composed of 8 places in 370 ms
[2020-06-03 16:31:49] [INFO ] Deduced a trap composed of 12 places in 308 ms
[2020-06-03 16:31:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 873 ms
[2020-06-03 16:31:49] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 51 ms.
[2020-06-03 16:31:55] [INFO ] Added : 319 causal constraints over 64 iterations in 5833 ms. Result :sat
[2020-06-03 16:31:55] [INFO ] Deduced a trap composed of 52 places in 257 ms
[2020-06-03 16:31:55] [INFO ] Deduced a trap composed of 50 places in 238 ms
[2020-06-03 16:31:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 758 ms
[2020-06-03 16:31:56] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 16:31:56] [INFO ] Flatten gal took : 166 ms
[2020-06-03 16:31:56] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 16:31:56] [INFO ] Flatten gal took : 79 ms
FORMULA DES-PT-60b-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:31:56] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 8 ms.
[2020-06-03 16:31:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DES-PT-60b @ 3570 seconds

FORMULA DES-PT-60b-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3294
rslt: Output for CTLCardinality @ DES-PT-60b

{
"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 16:31:56 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((((1 <= p29)) AND ((p306 <= 0)))))",
"processed_size": 40,
"rewrites": 26
},
"result":
{
"edges": 5368,
"markings": 5369,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "(((1 <= p15)) AND ((p355 <= 0)))",
"processed_size": 32,
"rewrites": 27
},
"result":
{
"edges": 7453,
"markings": 7454,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"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 ((((p80 <= 0)) OR ((1 <= p505)))))",
"processed_size": 40,
"rewrites": 27
},
"result":
{
"edges": 16140343,
"markings": 13857660,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 488
},
"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 ((((p462 <= 0)) OR ((1 <= p152)) OR ((p479 <= 0)) OR ((1 <= p230)))))",
"processed_size": 77,
"rewrites": 27
},
"result":
{
"produced_by": "state equation",
"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": 569
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (G (((p230 <= 0))))",
"processed_size": 21,
"rewrites": 26
},
"result":
{
"edges": 88,
"markings": 89,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 683
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((((p343 <= 0)) OR ((1 <= p403)))))",
"processed_size": 41,
"rewrites": 26
},
"result":
{
"edges": 88,
"markings": 89,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 854
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((((p313 <= 0)) OR ((1 <= p460)))))",
"processed_size": 41,
"rewrites": 26
},
"result":
{
"edges": 140484,
"markings": 133810,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1139
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p158 <= 0)) OR ((1 <= p215)) OR ((p229 <= 0)) OR ((1 <= p309)))",
"processed_size": 69,
"rewrites": 28
},
"result":
{
"edges": 88,
"markings": 89,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 (G ((((p472 <= 0)) OR ((1 <= p401)))))",
"processed_size": 41,
"rewrites": 26
},
"result":
{
"edges": 88,
"markings": 89,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3417
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"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": "E (F ((((1 <= p231)) AND ((p376 <= 0)) AND ((1 <= p287)) AND ((p26 <= 0)))))",
"processed_size": 76,
"rewrites": 26
},
"result":
{
"edges": 15142380,
"markings": 10956686,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"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": "A (((((p223 <= 0)) OR ((1 <= p445))) U ((1 <= p18))))",
"processed_size": 54,
"rewrites": 30
},
"result":
{
"edges": 87,
"markings": 88,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 33800,
"runtime": 276.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : E(X(E(F(*)))) : A(G(**)) : TRUE : E(G(**)) : (A((** U **)) AND (A(F(**)) OR (NODEADLOCK OR **))) : (DEADLOCK AND **) : A(G(**)) : (E(F(*)) AND E(G(*))) : E(G(**)) : (E(F(**)) OR A(X(*))) : E(F(E(G(**)))) : TRUE"
},
"net":
{
"arcs": 1623,
"conflict_clusters": 192,
"places": 519,
"places_significant": 454,
"singleton_clusters": 0,
"transitions": 470
},
"result":
{
"preliminary_value": "yes yes no yes yes no no no yes no yes yes yes ",
"value": "yes yes no yes yes no no no yes no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 989/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 519
lola: finding significant places
lola: 519 places, 470 transitions, 454 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: (p403 <= 1)
lola: LP says that atomic proposition is always true: (p355 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p386 <= 1)
lola: LP says that atomic proposition is always true: (p515 <= 1)
lola: LP says that atomic proposition is always true: (p464 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p460 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p376 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p401 <= 1)
lola: LP says that atomic proposition is always true: (p460 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p326 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: E (G ((((p343 <= 0)) OR ((1 <= p403))))) : E (X (NOT(A (G ((((p15 <= 0)) OR ((1 <= p355)))))))) : E (G (A (G ((((p462 <= 0)) OR ((1 <= p152)) OR ((p479 <= 0)) OR ((1 <= p230))))))) : E (G ((0 <= 0))) : E (G (((p230 <= 0)))) : (A (((((p223 <= 0)) OR ((1 <= p445))) U ((1 <= p18)))) AND ((A (F ((((p194 <= 0)) OR ((1 <= p386))))) OR NOT(A (X ((1 <= 0))))) OR ((((p469 <= 0)) OR ((1 <= p515))) AND (((p495 <= 0)) OR ((1 <= p464))) AND (((p30 <= 0)) OR ((1 <= p109)))))) : (A (X ((1 <= 0))) AND (((p445 <= 0)) OR ((1 <= p460)))) : A (G ((((p80 <= 0)) OR ((1 <= p505))))) : (NOT(A (G ((((p231 <= 0)) OR ((1 <= p376)) OR ((p287 <= 0)) OR ((1 <= p26)))))) AND NOT(A (F ((((1 <= p472)) AND ((p401 <= 0))))))) : E (G ((((p313 <= 0)) OR ((1 <= p460))))) : (E (F ((((1 <= p29)) AND ((p306 <= 0))))) OR NOT(E (X (((((p135 <= 0)) OR ((1 <= p218))) AND (((p340 <= 0)) OR ((1 <= p326)))))))) : E (F (E (G ((((p158 <= 0)) OR ((1 <= p215)) OR ((p229 <= 0)) OR ((1 <= p309))))))) : E (G ((0 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK AND (((p445 <= 0)) OR ((1 <= p460))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (DEADLOCK AND (((p445 <= 0)) OR ((1 <= p460))))
lola: processed formula length: 48
lola: 26 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 2 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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: subprocess 3 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p29)) AND ((p306 <= 0))))) OR A (X (((((1 <= p135)) AND ((p218 <= 0))) OR (((1 <= p340)) AND ((p326 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p29)) AND ((p306 <= 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 <= p29)) AND ((p306 <= 0)))))
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: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 <= p29)) AND ((p306 <= 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-3-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: 5369 markings, 5368 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p15)) AND ((p355 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (((1 <= p15)) AND ((p355 <= 0)))
lola: processed formula length: 32
lola: 27 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p15)) AND ((p355 <= 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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 7454 markings, 7453 edges
lola: ========================================
lola: subprocess 5 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p80 <= 0)) OR ((1 <= p505)))))
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 ((((p80 <= 0)) OR ((1 <= p505)))))
lola: processed formula length: 40
lola: 27 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 <= p80)) AND ((p505 <= 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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 612207 markings, 625772 edges, 122441 markings/sec, 0 secs
lola: sara is running 5 secs || 1226110 markings, 1253284 edges, 122781 markings/sec, 5 secs
lola: sara is running 10 secs || 1840737 markings, 1881552 edges, 122925 markings/sec, 10 secs
lola: sara is running 15 secs || 2453526 markings, 2507916 edges, 122558 markings/sec, 15 secs
lola: sara is running 20 secs || 3066397 markings, 3134389 edges, 122574 markings/sec, 20 secs
lola: sara is running 25 secs || 3628085 markings, 3752669 edges, 112338 markings/sec, 25 secs
lola: sara is running 30 secs || 4121682 markings, 4351540 edges, 98719 markings/sec, 30 secs
lola: sara is running 35 secs || 4620009 markings, 4957503 edges, 99665 markings/sec, 35 secs
lola: sara is running 40 secs || 5104821 markings, 5543993 edges, 96962 markings/sec, 40 secs
lola: sara is running 45 secs || 5602919 markings, 6149608 edges, 99620 markings/sec, 45 secs
lola: sara is running 50 secs || 6103505 markings, 6757641 edges, 100117 markings/sec, 50 secs
lola: sara is running 55 secs || 6605828 markings, 7366121 edges, 100465 markings/sec, 55 secs
lola: sara is running 60 secs || 7106047 markings, 7973049 edges, 100044 markings/sec, 60 secs
lola: sara is running 65 secs || 7608496 markings, 8582147 edges, 100490 markings/sec, 65 secs
lola: sara is running 70 secs || 8108415 markings, 9188257 edges, 99984 markings/sec, 70 secs
lola: sara is running 75 secs || 8610075 markings, 9795556 edges, 100332 markings/sec, 75 secs
lola: sara is running 80 secs || 9114220 markings, 10406076 edges, 100829 markings/sec, 80 secs
lola: sara is running 85 secs || 9606775 markings, 11003052 edges, 98511 markings/sec, 85 secs
lola: sara is running 90 secs || 10084222 markings, 11580205 edges, 95489 markings/sec, 90 secs
lola: sara is running 95 secs || 10562305 markings, 12159706 edges, 95617 markings/sec, 95 secs
lola: sara is running 100 secs || 11039800 markings, 12738171 edges, 95499 markings/sec, 100 secs
lola: sara is running 105 secs || 11519664 markings, 13319424 edges, 95973 markings/sec, 105 secs
lola: sara is running 110 secs || 12002748 markings, 13904207 edges, 96617 markings/sec, 110 secs
lola: sara is running 115 secs || 12488535 markings, 14492144 edges, 97157 markings/sec, 115 secs
lola: sara is running 120 secs || 12976083 markings, 15082535 edges, 97510 markings/sec, 120 secs
lola: sara is running 125 secs || 13463728 markings, 15673069 edges, 97529 markings/sec, 125 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13857660 markings, 16140343 edges
lola: ========================================
lola: subprocess 6 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p462 <= 0)) OR ((1 <= p152)) OR ((p479 <= 0)) OR ((1 <= p230)))))
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 ((((p462 <= 0)) OR ((1 <= p152)) OR ((p479 <= 0)) OR ((1 <= p230)))))
lola: processed formula length: 77
lola: 27 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 <= p462)) AND ((p152 <= 0)) AND ((1 <= p479)) AND ((p230 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p230 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p230 <= 0))))
lola: processed formula length: 21
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p230))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 89 markings, 88 edges
lola: ========================================
lola: subprocess 8 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p343 <= 0)) OR ((1 <= p403)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p343 <= 0)) OR ((1 <= p403)))))
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 89 markings, 88 edges
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 <= p343)) AND ((p403 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 854 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p313 <= 0)) OR ((1 <= p460)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p313 <= 0)) OR ((1 <= p460)))))
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p313)) AND ((p460 <= 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-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 133810 markings, 140484 edges
lola: ========================================
lola: subprocess 10 will run for 1139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((((p158 <= 0)) OR ((1 <= p215)) OR ((p229 <= 0)) OR ((1 <= p309)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (((p158 <= 0)) OR ((1 <= p215)) OR ((p229 <= 0)) OR ((1 <= p309)))
lola: processed formula length: 69
lola: 28 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p158 <= 0)) OR ((1 <= p215)) OR ((p229 <= 0)) OR ((1 <= p309)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 89 markings, 88 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p158)) AND ((p215 <= 0)) AND ((1 <= p229)) AND ((p309 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 1708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p231)) AND ((p376 <= 0)) AND ((1 <= p287)) AND ((p26 <= 0))))) AND E (G ((((p472 <= 0)) OR ((1 <= p401))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file CTLCardinality-10-1.sara.
lola: subprocess 11 will run for 1708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p472 <= 0)) OR ((1 <= p401)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p472 <= 0)) OR ((1 <= p401)))))
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p472)) AND ((p401 <= 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 / EG
lola: The predicate is possibly preserved.
lola: 89 markings, 88 edges
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
lola: ========================================
lola: subprocess 12 will run for 3417 seconds at most (--localtimelimit=0)
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: E (F ((((1 <= p231)) AND ((p376 <= 0)) AND ((1 <= p287)) AND ((p26 <= 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 <= p231)) AND ((p376 <= 0)) AND ((1 <= p287)) AND ((p26 <= 0)))))
lola: processed formula length: 76
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: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 <= p231)) AND ((p376 <= 0)) AND ((1 <= p287)) AND ((p26 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 520065 markings, 543363 edges, 104013 markings/sec, 0 secs
lola: sara is running 5 secs || 1050389 markings, 1097056 edges, 106065 markings/sec, 5 secs
lola: sara is running 10 secs || 1579554 markings, 1649512 edges, 105833 markings/sec, 10 secs
lola: sara is running 15 secs || 2109571 markings, 2202901 edges, 106003 markings/sec, 15 secs
lola: sara is running 20 secs || 2636762 markings, 2753252 edges, 105438 markings/sec, 20 secs
lola: sara is running 25 secs || 3164619 markings, 3304374 edges, 105571 markings/sec, 25 secs
lola: sara is running 30 secs || 3687080 markings, 3857540 edges, 104492 markings/sec, 30 secs
lola: sara is running 35 secs || 4069436 markings, 4528574 edges, 76471 markings/sec, 35 secs
lola: sara is running 40 secs || 4495467 markings, 5152410 edges, 85206 markings/sec, 40 secs
lola: sara is running 45 secs || 4935076 markings, 5766585 edges, 87922 markings/sec, 45 secs
lola: sara is running 50 secs || 5345005 markings, 6419724 edges, 81986 markings/sec, 50 secs
lola: sara is running 55 secs || 5723442 markings, 7092687 edges, 75687 markings/sec, 55 secs
lola: sara is running 60 secs || 6139418 markings, 7716961 edges, 83195 markings/sec, 60 secs
lola: sara is running 65 secs || 6578323 markings, 8326310 edges, 87781 markings/sec, 65 secs
lola: sara is running 70 secs || 6988538 markings, 8974787 edges, 82043 markings/sec, 70 secs
lola: sara is running 75 secs || 7365991 markings, 9644790 edges, 75491 markings/sec, 75 secs
lola: sara is running 80 secs || 7780586 markings, 10271874 edges, 82919 markings/sec, 80 secs
lola: sara is running 85 secs || 8219945 markings, 10881698 edges, 87872 markings/sec, 85 secs
lola: sara is running 90 secs || 8632381 markings, 11530427 edges, 82487 markings/sec, 90 secs
lola: sara is running 95 secs || 9007721 markings, 12196056 edges, 75068 markings/sec, 95 secs
lola: sara is running 100 secs || 9421413 markings, 12828054 edges, 82738 markings/sec, 100 secs
lola: sara is running 105 secs || 9862793 markings, 13440252 edges, 88276 markings/sec, 105 secs
lola: sara is running 110 secs || 10276232 markings, 14086895 edges, 82688 markings/sec, 110 secs
lola: sara is running 115 secs || 10657497 markings, 14755693 edges, 76253 markings/sec, 115 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10956686 markings, 15142380 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 3294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((p223 <= 0)) OR ((1 <= p445))) U ((1 <= p18)))) AND (A (F ((((p194 <= 0)) OR ((1 <= p386))))) OR (NOT DEADLOCK OR ((((p469 <= 0)) OR ((1 <= p515))) AND (((p495 <= 0)) OR ((1 <= p464))) AND (((p30 <= 0)) OR ((1 <= p109)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p223 <= 0)) OR ((1 <= p445))) U ((1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((p223 <= 0)) OR ((1 <= p445))) U ((1 <= p18))))
lola: processed formula length: 54
lola: 30 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p223 <= 0)) OR ((1 <= p445)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 88 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no no no yes no yes yes yes
lola:
preliminary result: yes yes no yes yes no no no yes no yes yes yes
lola: memory consumption: 33800 KB
lola: time consumption: 276 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="DES-PT-60b"
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 DES-PT-60b, 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 r180-ebro-158987900100331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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