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.r176-tajo-158987872400795.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 QuasiCertifProtocol-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400795
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 11K Apr 12 06:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 12 06:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 11 07:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 07:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 9 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 9 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 290K 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 QuasiCertifProtocol-PT-10-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591181997892

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:59:59] [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 10:59:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:59:59] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-06-03 10:59:59] [INFO ] Transformed 550 places.
[2020-06-03 10:59:59] [INFO ] Transformed 176 transitions.
[2020-06-03 10:59:59] [INFO ] Parsed PT model containing 550 places and 176 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Incomplete random walk after 100000 steps, including 6923 resets, run finished after 1215 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 176 rows 550 cols
[2020-06-03 11:00:00] [INFO ] Computed 375 place invariants in 40 ms
[2020-06-03 11:00:01] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2020-06-03 11:00:01] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 195 ms returned sat
[2020-06-03 11:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:01] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2020-06-03 11:00:02] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 20 ms.
[2020-06-03 11:00:02] [INFO ] Added : 77 causal constraints over 16 iterations in 399 ms. Result :sat
[2020-06-03 11:00:02] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-03 11:00:02] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 157 ms returned sat
[2020-06-03 11:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:03] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2020-06-03 11:00:03] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 17 ms.
[2020-06-03 11:00:03] [INFO ] Added : 80 causal constraints over 16 iterations in 346 ms. Result :sat
[2020-06-03 11:00:03] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:04] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 311 ms returned sat
[2020-06-03 11:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:04] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2020-06-03 11:00:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2020-06-03 11:00:05] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 229 ms returned sat
[2020-06-03 11:00:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:05] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2020-06-03 11:00:06] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 25 ms.
[2020-06-03 11:00:06] [INFO ] Added : 92 causal constraints over 19 iterations in 765 ms. Result :sat
[2020-06-03 11:00:06] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:00:07] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 201 ms returned sat
[2020-06-03 11:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:08] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2020-06-03 11:00:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-06-03 11:00:08] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 304 ms returned sat
[2020-06-03 11:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:09] [INFO ] [Nat]Absence check using state equation in 953 ms returned sat
[2020-06-03 11:00:09] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 29 ms.
[2020-06-03 11:00:10] [INFO ] Added : 39 causal constraints over 8 iterations in 234 ms. Result :sat
[2020-06-03 11:00:10] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 11:00:10] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 323 ms returned sat
[2020-06-03 11:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:11] [INFO ] [Real]Absence check using state equation in 1032 ms returned sat
[2020-06-03 11:00:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:11] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 186 ms returned sat
[2020-06-03 11:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:12] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2020-06-03 11:00:12] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 25 ms.
[2020-06-03 11:00:12] [INFO ] Added : 76 causal constraints over 16 iterations in 358 ms. Result :sat
[2020-06-03 11:00:12] [INFO ] [Real]Absence check using 3 positive place invariants in 27 ms returned sat
[2020-06-03 11:00:13] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 200 ms returned sat
[2020-06-03 11:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:13] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2020-06-03 11:00:13] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 23 ms.
[2020-06-03 11:00:14] [INFO ] Added : 41 causal constraints over 9 iterations in 182 ms. Result :sat
[2020-06-03 11:00:14] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2020-06-03 11:00:14] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-03 11:00:14] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 182 ms returned sat
[2020-06-03 11:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:15] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2020-06-03 11:00:15] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 16 ms.
[2020-06-03 11:00:15] [INFO ] Added : 77 causal constraints over 16 iterations in 346 ms. Result :sat
[2020-06-03 11:00:15] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-03 11:00:15] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 191 ms returned sat
[2020-06-03 11:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:16] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2020-06-03 11:00:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:16] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 186 ms returned sat
[2020-06-03 11:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:17] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2020-06-03 11:00:17] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 16 ms.
[2020-06-03 11:00:17] [INFO ] Added : 76 causal constraints over 16 iterations in 258 ms. Result :sat
[2020-06-03 11:00:17] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:17] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 206 ms returned sat
[2020-06-03 11:00:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:18] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2020-06-03 11:00:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-03 11:00:18] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 206 ms returned sat
[2020-06-03 11:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:21] [INFO ] [Nat]Absence check using state equation in 2546 ms returned unsat
[2020-06-03 11:00:21] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:21] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 193 ms returned sat
[2020-06-03 11:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:22] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2020-06-03 11:00:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:22] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 184 ms returned sat
[2020-06-03 11:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:23] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2020-06-03 11:00:23] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 11 ms.
[2020-06-03 11:00:23] [INFO ] Added : 71 causal constraints over 15 iterations in 246 ms. Result :sat
[2020-06-03 11:00:23] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned unsat
[2020-06-03 11:00:23] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 11:00:23] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 175 ms returned sat
[2020-06-03 11:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:24] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2020-06-03 11:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:24] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 190 ms returned sat
[2020-06-03 11:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:25] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2020-06-03 11:00:25] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 18 ms.
[2020-06-03 11:00:25] [INFO ] Added : 24 causal constraints over 5 iterations in 110 ms. Result :sat
[2020-06-03 11:00:25] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-03 11:00:25] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 227 ms returned sat
[2020-06-03 11:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:26] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2020-06-03 11:00:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 11:00:26] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 135 ms returned sat
[2020-06-03 11:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:27] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2020-06-03 11:00:27] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 12 ms.
[2020-06-03 11:00:27] [INFO ] Added : 79 causal constraints over 16 iterations in 216 ms. Result :sat
[2020-06-03 11:00:27] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 11:00:27] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 140 ms returned sat
[2020-06-03 11:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:28] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2020-06-03 11:00:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 11:00:28] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 135 ms returned sat
[2020-06-03 11:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:28] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2020-06-03 11:00:28] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 12 ms.
[2020-06-03 11:00:28] [INFO ] Added : 51 causal constraints over 11 iterations in 191 ms. Result :sat
[2020-06-03 11:00:29] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:29] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 188 ms returned sat
[2020-06-03 11:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:29] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-06-03 11:00:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-03 11:00:30] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 187 ms returned sat
[2020-06-03 11:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:30] [INFO ] [Nat]Absence check using state equation in 627 ms returned unsat
[2020-06-03 11:00:30] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:31] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 186 ms returned sat
[2020-06-03 11:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:31] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2020-06-03 11:00:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:32] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 190 ms returned sat
[2020-06-03 11:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:32] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2020-06-03 11:00:32] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 13 ms.
[2020-06-03 11:00:33] [INFO ] Added : 78 causal constraints over 16 iterations in 253 ms. Result :sat
[2020-06-03 11:00:33] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-03 11:00:33] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 185 ms returned sat
[2020-06-03 11:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:33] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2020-06-03 11:00:33] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 16 ms.
[2020-06-03 11:00:34] [INFO ] Added : 51 causal constraints over 11 iterations in 189 ms. Result :sat
[2020-06-03 11:00:34] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-03 11:00:34] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 199 ms returned sat
[2020-06-03 11:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:35] [INFO ] [Real]Absence check using state equation in 604 ms returned unsat
[2020-06-03 11:00:35] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-03 11:00:35] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 187 ms returned sat
[2020-06-03 11:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:35] [INFO ] [Real]Absence check using state equation in 111 ms returned unsat
[2020-06-03 11:00:35] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-03 11:00:35] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 189 ms returned sat
[2020-06-03 11:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:35] [INFO ] [Real]Absence check using state equation in 100 ms returned unsat
[2020-06-03 11:00:35] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-03 11:00:36] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 210 ms returned sat
[2020-06-03 11:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:36] [INFO ] [Real]Absence check using state equation in 116 ms returned unsat
[2020-06-03 11:00:36] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-03 11:00:36] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 192 ms returned sat
[2020-06-03 11:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:37] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2020-06-03 11:00:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:37] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 192 ms returned sat
[2020-06-03 11:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:38] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2020-06-03 11:00:38] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 16 ms.
[2020-06-03 11:00:38] [INFO ] Added : 78 causal constraints over 16 iterations in 251 ms. Result :sat
[2020-06-03 11:00:38] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:38] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 191 ms returned sat
[2020-06-03 11:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:39] [INFO ] [Real]Absence check using state equation in 430 ms returned unsat
[2020-06-03 11:00:39] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:39] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 202 ms returned sat
[2020-06-03 11:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:40] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2020-06-03 11:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:40] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 185 ms returned sat
[2020-06-03 11:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:40] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2020-06-03 11:00:40] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 23 ms.
[2020-06-03 11:00:41] [INFO ] Added : 79 causal constraints over 16 iterations in 298 ms. Result :sat
[2020-06-03 11:00:41] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-03 11:00:41] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 193 ms returned sat
[2020-06-03 11:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:42] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2020-06-03 11:00:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:42] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 187 ms returned sat
[2020-06-03 11:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:43] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2020-06-03 11:00:43] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 21 ms.
[2020-06-03 11:00:43] [INFO ] Added : 39 causal constraints over 8 iterations in 177 ms. Result :sat
[2020-06-03 11:00:43] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-03 11:00:43] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 192 ms returned sat
[2020-06-03 11:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:44] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2020-06-03 11:00:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 11:00:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 11:00:44] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 185 ms returned sat
[2020-06-03 11:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:45] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2020-06-03 11:00:45] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 18 ms.
[2020-06-03 11:00:45] [INFO ] Added : 39 causal constraints over 8 iterations in 145 ms. Result :sat
[2020-06-03 11:00:45] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-03 11:00:45] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 186 ms returned sat
[2020-06-03 11:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:46] [INFO ] [Real]Absence check using state equation in 576 ms returned unsat
[2020-06-03 11:00:46] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-03 11:00:46] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 185 ms returned sat
[2020-06-03 11:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:47] [INFO ] [Real]Absence check using state equation in 588 ms returned unsat
[2020-06-03 11:00:47] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-03 11:00:47] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 168 ms returned unsat
[2020-06-03 11:00:47] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-03 11:00:47] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 180 ms returned sat
[2020-06-03 11:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 11:00:48] [INFO ] [Real]Absence check using state equation in 576 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
[2020-06-03 11:00:48] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 11:00:48] [INFO ] Flatten gal took : 90 ms
[2020-06-03 11:00:48] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 11:00:48] [INFO ] Flatten gal took : 36 ms
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 11:00:48] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2020-06-03 11:00:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ QuasiCertifProtocol-PT-10 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3425
rslt: Output for CTLCardinality @ QuasiCertifProtocol-PT-10

{
"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",
"--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 11:00:48 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 121,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 121,
"visible_transitions": 0
},
"processed": "(p364 + p362 + p361 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p357 + p358 + p359 + p360 + p363 + p365 + p366 + p367 + p368 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 <= 2)",
"processed_size": 851,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G ((p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 <= 2)))",
"processed_size": 89,
"rewrites": 26
},
"result":
{
"edges": 66,
"markings": 67,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (G ((p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 <= 2)))",
"processed_size": 89,
"rewrites": 25
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 132,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 132,
"visible_transitions": 0
},
"processed": "(p206 + p207 + p208 + p221 + p222 + p223 + p224 + p225 + p226 + p229 + p230 + p231 + p237 + p239 + p253 + p257 + p319 + p289 + p285 + p265 + p264 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p263 + p286 + p287 + p288 + p262 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p261 + p260 + p320 + p321 + p322 + p323 + p324 + p259 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p258 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p238 + p236 + p235 + p234 + p233 + p232 + p228 + p227 + 1 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369)",
"processed_size": 928,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p123 <= p533)",
"processed_size": 14,
"rewrites": 27
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "(p495 + 1 <= p81)",
"processed_size": 17,
"rewrites": 27
},
"result":
{
"edges": 5166893,
"markings": 868353,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p205 + 1 <= p11) OR (p407 <= 0))",
"processed_size": 35,
"rewrites": 27
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 44,
"visible_transitions": 0
},
"processed": "E (G (((p24 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + 1 <= p82 + p81 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p84) AND (p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 + 1 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369))))",
"processed_size": 309,
"rewrites": 25
},
"result":
{
"edges": 41368901,
"markings": 5984267,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 66
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 696
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "EF(A((3 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369) U (3 <= p534 + p535 + p536 + p537 + p538 + p540 + p541 + p546 + p547 + p548 + p549)))",
"processed_size": 172,
"rewrites": 26
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 7913573,
"markings": 3239140,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 867
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 ((p372 <= p402)))",
"processed_size": 22,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1156
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "E (F (((p513 + 1 <= p114) OR (p513 + 1 <= p99))))",
"processed_size": 50,
"rewrites": 25
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1156
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525)) OR (1 <= p450 + p449 + p448 + p447 + p446 + p445 + p502 + p505 + p506 + p507 + p508)))",
"processed_size": 176,
"rewrites": 26
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1735
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (((p0 + 1 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25) U (3 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))",
"processed_size": 154,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 88
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 34,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 34,
"visible_transitions": 0
},
"processed": "E (G ((((p78 <= p205 + p220 + p219 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209) AND (p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))))",
"processed_size": 243,
"rewrites": 25
},
"result":
{
"edges": 22492913,
"markings": 3046301,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 61
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p255 <= p279)))",
"processed_size": 22,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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 (((p119 <= p413) OR (p515 <= p540))))",
"processed_size": 43,
"rewrites": 26
},
"result":
{
"edges": 66,
"markings": 67,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24900,
"runtime": 145.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** AND E(G(*))) OR (E(X(**)) AND A(G(**)))) : (A((** U **)) OR E(G(**))) : E(F(A((** U **)))) : (A(G(*)) AND (A(X(**)) OR **)) : TRUE : A(G((A(F(**)) OR **))) : E(G(*)) : (E(F(*)) AND E(F(*))) : E(F(E(G(**)))) : A(F(**)) : (A(G(**)) AND (A(F(*)) AND E(F(**)))) : A(F(**))"
},
"net":
{
"arcs": 1287,
"conflict_clusters": 44,
"places": 550,
"places_significant": 175,
"singleton_clusters": 0,
"transitions": 176
},
"result":
{
"preliminary_value": "yes no yes no yes no no yes yes no no yes ",
"value": "yes no yes no yes no no yes yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 726/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17600
lola: finding significant places
lola: 550 places, 176 transitions, 175 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 false: (2 <= p80)
lola: (((p206 + p207 + p208 + p221 + p222 + p223 + p224 + p225 + p226 + p229 + p230 + p231 + p237 + p239 + p253 + p257 + p319 + p289 + p285 + p265 + p264 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p263 + p286 + p287 + p288 + p262 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p261 + p260 + p320 + p321 + p322 + p323 + p324 + p259 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p258 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p238 + p236 + p235 + p234 + p233 + p232 + p228 + p227 + 1 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369) AND NOT(A (F ((3 <= p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545))))) OR (E (X ((p90 + 1 <= p205 + p220 + p219 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209))) AND A (G ((p206 + p207 + p208 + p221 + p222 + p223 + p224 + p225 + p226 + p229 + p230 + p231 + p237 + p239 + p253 + p257 + p319 + p289 + p285 + p265 + p264 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p263 + p286 + p287 + p288 + p262 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p261 + p260 + p320 + p321 + p322 + p323 + p324 + p259 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p258 + p256 + p255 + p254 + p252 + p251 + p250 + p249 + p248 + p247 + p246 + p245 + p244 + p243 + p242 + p241 + p240 + p238 + p236 + p235 + p234 + p233 + p232 + p228 + p227 <= p488 + p487 + p486 + p485 + p483 + p482 + p481 + p489 + p490 + p491 + p492))))) : (A (((p0 + 1 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25) U (3 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25))) OR E (G ((((p78 <= p205 + p220 + p219 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209) AND (p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))))) : E (F (A (((3 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369) U (3 <= p534 + p535 + p536 + p537 + p538 + p540 + p541 + p546 + p547 + p548 + p549))))) : (NOT(E (F ((3 <= p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545)))) AND (A (X ((1 <= p90))) OR (p364 + p362 + p361 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p357 + p358 + p359 + p360 + p363 + p365 + p366 + p367 + p368 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 <= 2))) : E (G ((0 <= 0))) : A (G ((A (F ((1 <= p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525))) OR (1 <= p450 + p449 + p448 + p447 + p446 + p445 + p502 + p505 + p506 + p507 + p508)))) : NOT(A (F (((p82 + p81 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p84 <= p24 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13) OR (p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369 <= p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545))))) : (NOT(A (G (((p114 <= p513) AND (p99 <= p513))))) AND NOT(A (G ((p402 + 1 <= p372))))) : E (((0 <= 0) U E (G ((p123 <= p533))))) : A (F (((p11 <= p205) AND (1 <= p407)))) : ((A (G (((p119 <= p413) OR (p515 <= p540)))) AND NOT(E (G ((p239 <= p191))))) AND E (F ((p255 <= p279)))) : A (F ((p81 <= p495)))
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:332
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: 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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 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: 24 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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 <= 2))) AND (A (X ((1 <= p90))) OR (p364 + p362 + p361 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p357 + p358 + p359 + p360 + p363 + p365 + p366 + p367 + p368 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p364 + p362 + p361 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p357 + p358 + p359 + p360 + p363 + p365 + p366 + p367 + p368 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p364 + p362 + p361 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p357 + p358 + p359 + p360 + p363 + p365 + p366 + p367 + p368 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + ... (shortened)
lola: processed formula length: 851
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 <= 2)))
lola: processed formula length: 89
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545)
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 67 markings, 66 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p206 + p207 + p208 + p221 + p222 + p223 + p224 + p225 + p226 + p229 + p230 + p231 + p237 + p239 + p253 + p257 + p319 + p289 + p285 + p265 + p264 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p263 + p286 + p287 + p288 + p262 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 <= 2)))
lola: processed formula length: 89
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 14 markings, 13 edges
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: (3 <= p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p206 + p207 + p208 + p221 + p222 + p223 + p224 + p225 + p226 + p229 + p230 + p231 + p237 + p239 + p253 + p257 + p319 + p289 + p285 + p265 + p264 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p263 + p286 + p287 + p288 + p262 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p206 + p207 + p208 + p221 + p222 + p223 + p224 + p225 + p226 + p229 + p230 + p231 + p237 + p239 + p253 + p257 + p319 + p289 + p285 + p265 + p264 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p263 + p286 + p287 + p288 + p262 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + ... (shortened)
lola: processed formula length: 928
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p123 <= p533)))))
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: (p123 <= p533)
lola: processed formula length: 14
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 /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: 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: The predicate is possibly preserved from a reachable marking.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p81 <= p495)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p495 + 1 <= p81)
lola: processed formula length: 17
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 / 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p81 <= p495)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 476479 markings, 2738424 edges, 95296 markings/sec, 0 secs || sara is running 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 868353 markings, 5166893 edges
lola: ========================================
lola: subprocess 5 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p11 <= p205) AND (1 <= p407))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p205 + 1 <= p11) OR (p407 <= 0))
lola: processed formula length: 35
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 / 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:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: state equation task get result unparse finished++ id 0
lola: 14 markings, 13 edges
lola: formula 0: ((p11 <= p205) AND (1 <= p407))
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 6 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p24 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + 1 <= p82 + p81 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p84) AND (p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 + 1 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p24 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + 1 <= p82 + p81 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p84) AND (p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545 + 1 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369))))
lola: processed formula length: 309
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: ((p82 + p81 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p84 <= p24 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13) OR (p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369 <= p509 + p511 + p512 + p513 + p514 + p515 + p516 + p542 + p543 + p544 + p545))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 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: 469503 markings, 2830545 edges, 93901 markings/sec, 0 secs || sara is running 0 secs
lola: 932273 markings, 5818580 edges, 92554 markings/sec, 5 secs || sara is running 5 secs
lola: 1366749 markings, 8756638 edges, 86895 markings/sec, 10 secs || sara is running 10 secs
lola: 1812273 markings, 11700613 edges, 89105 markings/sec, 15 secs || sara is running 15 secs
lola: 2239432 markings, 14633916 edges, 85432 markings/sec, 20 secs || sara is running 20 secs
lola: 2619496 markings, 17269362 edges, 76013 markings/sec, 25 secs || sara is running 25 secs
lola: 2988177 markings, 19969243 edges, 73736 markings/sec, 30 secs || sara is running 30 secs
lola: 3435697 markings, 22874543 edges, 89504 markings/sec, 35 secs || sara is running 35 secs
lola: 3851057 markings, 25736806 edges, 83072 markings/sec, 40 secs || sara is running 40 secs
lola: 4248980 markings, 28552343 edges, 79585 markings/sec, 45 secs || sara is running 45 secs
lola: 4640628 markings, 31357921 edges, 78330 markings/sec, 50 secs || sara is running 50 secs
lola: 5034550 markings, 34172278 edges, 78784 markings/sec, 55 secs || sara is running 55 secs
lola: 5414976 markings, 36967983 edges, 76085 markings/sec, 60 secs || sara is running 60 secs
lola: 5779843 markings, 39722172 edges, 72973 markings/sec, 65 secs || sara is running 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 5984267 markings, 41368901 edges
lola: ========================================
lola: subprocess 7 will run for 696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (((3 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369) U (3 <= p534 + p535 + p536 + p537 + p538 + p540 + p541 + p546 + p547 + p548 + p549)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A((3 <= p325 + p317 + p318 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p369) U (3 <= p534 + p535 + p536 + p537 + p538 + p540 + p541 + p546 + p547 + p548 + p549)))
lola: processed formula length: 172
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1437723 markings, 3036399 edges, 287545 markings/sec, 0 secs
lola: 2630692 markings, 5950399 edges, 238594 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3239140 markings, 7913573 edges
lola: ========================================
lola: subprocess 8 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p513 + 1 <= p114) OR (p513 + 1 <= p99)))) AND E (F ((p372 <= p402))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p372 <= p402)))
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 ((p372 <= p402)))
lola: processed formula length: 22
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p372 <= p402)
lola: state equation task get result unparse finished id 0
lola: ========================================
lola: subprocess 9 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p513 + 1 <= p114) OR (p513 + 1 <= p99))))
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 (((p513 + 1 <= p114) OR (p513 + 1 <= p99))))
lola: processed formula length: 50
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p513 + 1 <= p114) OR (p513 + 1 <= p99))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 63 markings, 62 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((1 <= p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525))) OR (1 <= p450 + p449 + p448 + p447 + p446 + p445 + p502 + p505 + p506 + p507 + p508))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525)) OR (1 <= p450 + p449 + p448 + p447 + p446 + p445 + p502 + p505 + p506 + p507 + p508)))
lola: processed formula length: 176
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 1735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p0 + 1 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25) U (3 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25))) OR E (G ((((p78 <= p205 + p220 + p219 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209) AND (p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p0 + 1 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25) U (3 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))
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 (((p0 + 1 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25) U (3 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))
lola: processed formula length: 154
lola: 29 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: 1
lola: formula 0: (p0 + 1 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p78 <= p205 + p220 + p219 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209) AND (p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p78 <= p205 + p220 + p219 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209) AND (p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525 <= p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25)))))
lola: processed formula length: 243
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: (((p205 + p220 + p219 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p209 + 1 <= p78) OR (p36 + p35 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + 1 <= p484 + p480 + p479 + p478 + p477 + p518 + p519 + p522 + p523 + p524 + p525)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
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.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 446449 markings, 2615501 edges, 89290 markings/sec, 0 secs || sara is running 0 secs
lola: 846242 markings, 5218608 edges, 79959 markings/sec, 5 secs || sara is running 5 secs
lola: 1243509 markings, 7722133 edges, 79453 markings/sec, 10 secs || sara is running 10 secs
lola: 1576292 markings, 10017565 edges, 66557 markings/sec, 15 secs || sara is running 15 secs
lola: 1886838 markings, 12485811 edges, 62109 markings/sec, 20 secs || sara is running 20 secs
lola: 2171790 markings, 15023943 edges, 56990 markings/sec, 25 secs || sara is running 25 secs
lola: 2528734 markings, 17619768 edges, 71389 markings/sec, 30 secs || sara is running 30 secs
lola: 2809722 markings, 20164687 edges, 56198 markings/sec, 35 secs || sara is running 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 3046301 markings, 22492913 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p119 <= p413) OR (p515 <= p540)))) AND (A (F ((p191 + 1 <= p239))) AND E (F ((p255 <= p279)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p255 <= p279)))
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 ((p255 <= p279)))
lola: processed formula length: 22
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p255 <= p279)
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p119 <= p413) OR (p515 <= p540))))
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 (((p119 <= p413) OR (p515 <= p540))))
lola: processed formula length: 43
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p413 + 1 <= p119) AND (p540 + 1 <= p515))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 67 markings, 66 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no yes yes no no yes
lola:
preliminary result: yes no yes no yes no no yes yes no no yes
lola: memory consumption: 24900 KB
lola: time consumption: 145 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="QuasiCertifProtocol-PT-10"
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 QuasiCertifProtocol-PT-10, 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 r176-tajo-158987872400795"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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