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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 07:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3.2K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 72K 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-COL-10-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591178693644

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:04:55] [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:04:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:04:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 10:04:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 649 ms
[2020-06-03 10:04:55] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2020-06-03 10:04:56] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 22 ms.
[2020-06-03 10:04:56] [INFO ] Computed order based on color domains.
[2020-06-03 10:04:56] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions in 18 ms.
[2020-06-03 10:04:56] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Incomplete random walk after 100000 steps, including 6914 resets, run finished after 1316 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 176 rows 550 cols
[2020-06-03 10:04:57] [INFO ] Computed 375 place invariants in 27 ms
[2020-06-03 10:04:57] [INFO ] [Real]Absence check using 15 positive place invariants in 35 ms returned sat
[2020-06-03 10:04:57] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 173 ms returned sat
[2020-06-03 10:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:04:58] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2020-06-03 10:04:58] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 13 ms.
[2020-06-03 10:04:58] [INFO ] Added : 62 causal constraints over 13 iterations in 297 ms. Result :sat
[2020-06-03 10:04:58] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2020-06-03 10:04:58] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 134 ms returned sat
[2020-06-03 10:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:04:59] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2020-06-03 10:04:59] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 52 ms.
[2020-06-03 10:04:59] [INFO ] Added : 76 causal constraints over 16 iterations in 389 ms. Result :sat
[2020-06-03 10:05:00] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-03 10:05:00] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 193 ms returned sat
[2020-06-03 10:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:01] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2020-06-03 10:05:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 33 ms returned sat
[2020-06-03 10:05:01] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 186 ms returned sat
[2020-06-03 10:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:02] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2020-06-03 10:05:02] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 20 ms.
[2020-06-03 10:05:02] [INFO ] Added : 93 causal constraints over 19 iterations in 348 ms. Result :sat
[2020-06-03 10:05:02] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-06-03 10:05:02] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 135 ms returned sat
[2020-06-03 10:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:03] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2020-06-03 10:05:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-06-03 10:05:03] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 193 ms returned sat
[2020-06-03 10:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:04] [INFO ] [Nat]Absence check using state equation in 839 ms returned sat
[2020-06-03 10:05:04] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 22 ms.
[2020-06-03 10:05:04] [INFO ] Added : 52 causal constraints over 11 iterations in 260 ms. Result :sat
[2020-06-03 10:05:04] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-06-03 10:05:04] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 120 ms returned sat
[2020-06-03 10:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:05] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2020-06-03 10:05:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2020-06-03 10:05:05] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 118 ms returned sat
[2020-06-03 10:05:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:06] [INFO ] [Nat]Absence check using state equation in 946 ms returned sat
[2020-06-03 10:05:06] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 21 ms.
[2020-06-03 10:05:07] [INFO ] Added : 65 causal constraints over 13 iterations in 264 ms. Result :sat
[2020-06-03 10:05:07] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 10:05:07] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 179 ms returned sat
[2020-06-03 10:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:08] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2020-06-03 10:05:08] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 23 ms.
[2020-06-03 10:05:08] [INFO ] Added : 53 causal constraints over 11 iterations in 316 ms. Result :sat
[2020-06-03 10:05:08] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned unsat
[2020-06-03 10:05:08] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2020-06-03 10:05:08] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 176 ms returned sat
[2020-06-03 10:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:09] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2020-06-03 10:05:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 27 ms returned sat
[2020-06-03 10:05:09] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 177 ms returned sat
[2020-06-03 10:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:10] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2020-06-03 10:05:10] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 8 ms.
[2020-06-03 10:05:10] [INFO ] Added : 58 causal constraints over 12 iterations in 185 ms. Result :sat
[2020-06-03 10:05:10] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 10:05:10] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 179 ms returned sat
[2020-06-03 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:11] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2020-06-03 10:05:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 27 ms returned sat
[2020-06-03 10:05:11] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 191 ms returned sat
[2020-06-03 10:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:12] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2020-06-03 10:05:12] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 26 ms.
[2020-06-03 10:05:12] [INFO ] Added : 51 causal constraints over 11 iterations in 178 ms. Result :sat
[2020-06-03 10:05:12] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2020-06-03 10:05:13] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 179 ms returned sat
[2020-06-03 10:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:14] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2020-06-03 10:05:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-06-03 10:05:14] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 188 ms returned sat
[2020-06-03 10:05:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:15] [INFO ] [Nat]Absence check using state equation in 954 ms returned unsat
[2020-06-03 10:05:15] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 10:05:15] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 199 ms returned sat
[2020-06-03 10:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:16] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2020-06-03 10:05:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-06-03 10:05:16] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 184 ms returned sat
[2020-06-03 10:05:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:17] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2020-06-03 10:05:17] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 17 ms.
[2020-06-03 10:05:17] [INFO ] Added : 72 causal constraints over 15 iterations in 235 ms. Result :sat
[2020-06-03 10:05:17] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned unsat
[2020-06-03 10:05:17] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-06-03 10:05:17] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 172 ms returned sat
[2020-06-03 10:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:18] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2020-06-03 10:05:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 10:05:18] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 176 ms returned sat
[2020-06-03 10:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:19] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2020-06-03 10:05:19] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 11 ms.
[2020-06-03 10:05:19] [INFO ] Added : 24 causal constraints over 5 iterations in 127 ms. Result :sat
[2020-06-03 10:05:19] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2020-06-03 10:05:19] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 167 ms returned sat
[2020-06-03 10:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:20] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-06-03 10:05:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2020-06-03 10:05:20] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 132 ms returned sat
[2020-06-03 10:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:21] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2020-06-03 10:05:21] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 13 ms.
[2020-06-03 10:05:21] [INFO ] Added : 53 causal constraints over 11 iterations in 179 ms. Result :sat
[2020-06-03 10:05:21] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned unsat
[2020-06-03 10:05:21] [INFO ] [Real]Absence check using 15 positive place invariants in 33 ms returned sat
[2020-06-03 10:05:21] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 194 ms returned sat
[2020-06-03 10:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:22] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2020-06-03 10:05:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 21 ms returned sat
[2020-06-03 10:05:22] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 184 ms returned sat
[2020-06-03 10:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:23] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2020-06-03 10:05:23] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 17 ms.
[2020-06-03 10:05:24] [INFO ] Added : 89 causal constraints over 18 iterations in 285 ms. Result :sat
[2020-06-03 10:05:24] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned unsat
[2020-06-03 10:05:24] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2020-06-03 10:05:24] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 186 ms returned sat
[2020-06-03 10:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:25] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2020-06-03 10:05:25] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 25 ms.
[2020-06-03 10:05:25] [INFO ] Added : 92 causal constraints over 19 iterations in 403 ms. Result :sat
[2020-06-03 10:05:25] [INFO ] [Real]Absence check using 15 positive place invariants in 22 ms returned sat
[2020-06-03 10:05:25] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 185 ms returned sat
[2020-06-03 10:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:26] [INFO ] [Real]Absence check using state equation in 522 ms returned unsat
[2020-06-03 10:05:26] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned unsat
[2020-06-03 10:05:26] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-06-03 10:05:26] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 217 ms returned sat
[2020-06-03 10:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:27] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2020-06-03 10:05:27] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 11 ms.
[2020-06-03 10:05:27] [INFO ] Added : 55 causal constraints over 11 iterations in 162 ms. Result :sat
[2020-06-03 10:05:27] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-06-03 10:05:27] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 189 ms returned sat
[2020-06-03 10:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:28] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2020-06-03 10:05:28] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 18 ms.
[2020-06-03 10:05:28] [INFO ] Added : 19 causal constraints over 4 iterations in 94 ms. Result :sat
[2020-06-03 10:05:28] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-06-03 10:05:28] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 207 ms returned sat
[2020-06-03 10:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:29] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2020-06-03 10:05:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-03 10:05:29] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 190 ms returned sat
[2020-06-03 10:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:30] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2020-06-03 10:05:30] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 17 ms.
[2020-06-03 10:05:30] [INFO ] Added : 24 causal constraints over 5 iterations in 103 ms. Result :sat
[2020-06-03 10:05:30] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-06-03 10:05:30] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 227 ms returned sat
[2020-06-03 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:31] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2020-06-03 10:05:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 27 ms returned sat
[2020-06-03 10:05:31] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 186 ms returned sat
[2020-06-03 10:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:32] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2020-06-03 10:05:32] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 25 ms.
[2020-06-03 10:05:32] [INFO ] Added : 71 causal constraints over 15 iterations in 313 ms. Result :sat
[2020-06-03 10:05:32] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-06-03 10:05:33] [INFO ] [Real]Absence check using 15 positive and 360 generalized place invariants in 172 ms returned sat
[2020-06-03 10:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:33] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2020-06-03 10:05:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:05:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned sat
[2020-06-03 10:05:34] [INFO ] [Nat]Absence check using 15 positive and 360 generalized place invariants in 179 ms returned sat
[2020-06-03 10:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:05:34] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2020-06-03 10:05:34] [INFO ] Computed and/alt/rep : 164/571/164 causal constraints in 23 ms.
[2020-06-03 10:05:34] [INFO ] Added : 24 causal constraints over 5 iterations in 107 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 10:05:34] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 10:05:34] [INFO ] Flatten gal took : 88 ms
[2020-06-03 10:05:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 10:05:35] [INFO ] Flatten gal took : 39 ms
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 10:05:35] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 7 ms.
[2020-06-03 10:05:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ QuasiCertifProtocol-COL-10 @ 3570 seconds

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3219
rslt: Output for CTLCardinality @ QuasiCertifProtocol-COL-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 10:05:35 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 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": "(p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 <= 2)",
"processed_size": 851,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 ((p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= 2)))",
"processed_size": 89,
"rewrites": 29
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 ((p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= 2)))",
"processed_size": 89,
"rewrites": 28
},
"result":
{
"edges": 26,
"markings": 27,
"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": 356
},
"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": "(p246 + p356 + p345 + p257 + p334 + p323 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p260 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p259 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p258 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p256 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p255 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + 1 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454)",
"processed_size": 928,
"rewrites": 27
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AX(EF((p532 + 1 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531)))",
"processed_size": 96,
"rewrites": 29
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 9811133,
"markings": 1307325,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "EG(EX((p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= 2)))",
"processed_size": 89,
"rewrites": 29
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 52900558,
"markings": 6682938,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 432
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2 <= 2)",
"processed_size": 9,
"rewrites": 30
},
"result":
{
"edges": 216,
"markings": 162,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 66
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 494
},
"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": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (G (((p536 <= 0) AND (p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= p0))))",
"processed_size": 108,
"rewrites": 28
},
"result":
{
"edges": 7018,
"markings": 1486,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 91
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 576
},
"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 (((p520 + p519 + p518 + p517 + p516 + p515 + p514 + p513 + p512 + p511 + p510 + 1 <= p465 + p464 + p463 + p462 + p461 + p460 + p459 + p458 + p457 + p456 + p455) AND (p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 + 1 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454))))",
"processed_size": 331,
"rewrites": 28
},
"result":
{
"edges": 41368901,
"markings": 5984267,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 677
},
"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 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454) U (3 <= p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367)))",
"processed_size": 172,
"rewrites": 29
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 7913567,
"markings": 3239140,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 842
},
"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 <= p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389)) OR (1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432)))",
"processed_size": 176,
"rewrites": 29
},
"result":
{
"edges": 33,
"markings": 33,
"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": 1123
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1123
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p538)",
"processed_size": 11,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1685
},
"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 ((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= 2)))",
"processed_size": 89,
"rewrites": 29
},
"result":
{
"edges": 85,
"markings": 86,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1685
},
"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 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499) U (3 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499)))",
"processed_size": 176,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 3371
},
"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 ((((p3 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549) AND (p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499)))))",
"processed_size": 253,
"rewrites": 28
},
"result":
{
"edges": 22492913,
"markings": 3046301,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3325
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 146,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 146,
"visible_transitions": 0
},
"processed": "((1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 <= p535) OR ((p532 <= p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488) AND (1 <= p537)))",
"processed_size": 1049,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 146,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 146,
"visible_transitions": 0
},
"processed": "((1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 <= p535) OR ((p532 <= p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488) AND (1 <= p537)))",
"processed_size": 1049,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 155,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 155,
"visible_transitions": 0
},
"processed": "E ((((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137) OR (p534 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549)) U (p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + 1 <= p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480 + p479 + p478 + p477)))",
"processed_size": 1109,
"rewrites": 30
},
"result":
{
"edges": 50918312,
"markings": 6091114,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25892,
"runtime": 351.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(G(*)) : A(X(E(F(*)))) : A(F(**)) : (A(G(*)) OR (A(F(**)) AND **)) : (E((** U **)) AND **) : E(G(E(X(**))))"
},
"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 no no no no no no ",
"value": "yes no yes no yes no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 <= p533)
lola: (((p246 + p356 + p345 + p257 + p334 + p323 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p260 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p259 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p258 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p256 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p255 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + 1 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454) AND NOT(A (F ((3 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531))))) OR (E (X ((p536 + 1 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549))) AND A (G ((p246 + p356 + p345 + p257 + p334 + p323 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p260 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p259 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p258 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p256 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p255 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 <= p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410))))) : (A (((p0 + 1 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499) U (3 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499))) OR E (G ((((p3 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549) AND (p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499)))))) : E (F (A (((3 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454) U (3 <= p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367))))) : (NOT(E (F ((3 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531)))) AND (A (X ((1 <= p536))) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 <= 2))) : E (G ((0 <= 0))) : A (G ((A (F ((1 <= p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389))) OR (1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432)))) : NOT(A (F (((p465 + p464 + p463 + p462 + p461 + p460 + p459 + p458 + p457 + p456 + p455 <= p520 + p519 + p518 + p517 + p516 + p515 + p514 + p513 + p512 + p511 + p510) OR (p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531))))) : NOT(A (F (((1 <= p536) OR (p0 + 1 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531))))) : NOT(E (X (A (G ((p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= p532)))))) : A (F ((3 <= p2))) : (NOT(E (F ((3 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549)))) OR (A (((0 <= 0) U (p0 <= p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367))) AND A (((1 <= 0) U (1 <= p538))))) : (E ((((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137) OR (p534 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549)) U (p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + 1 <= p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480 + p479 + p478 + p477))) AND ((1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 + p159 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150 + p149 + p148 + p146 + p145 + p144 + p143 + p142 + p141 + p140 + p139 + p138 + p137 <= p535) OR ((p532 <= p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488) AND (1 <= p537)))) : E (G (E (X ((p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= 2)))))
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 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: 27 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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= 2))) AND (A (X ((1 <= p536))) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + ... (shortened)
lola: processed formula length: 851
lola: 27 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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= 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 ((p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= 2)))
lola: processed formula length: 89
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)
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 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531)
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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p246 + p356 + p345 + p257 + p334 + p323 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= 2)))
lola: processed formula length: 89
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: (3 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 27 markings, 26 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p246 + p356 + p345 + p257 + p334 + p323 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p246 + p356 + p345 + p257 + p334 + p323 + p312 + p301 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + ... (shortened)
lola: processed formula length: 928
lola: 27 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 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p532 + 1 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((p532 + 1 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531)))
lola: processed formula length: 96
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 478089 markings, 3332192 edges, 95618 markings/sec, 0 secs
lola: 919052 markings, 6653122 edges, 88193 markings/sec, 5 secs
lola: 1303980 markings, 9779880 edges, 76986 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1307325 markings, 9811133 edges
lola: ========================================
lola: subprocess 4 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= 2)))
lola: processed formula length: 89
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 629047 markings, 2208583 edges, 125809 markings/sec, 0 secs
lola: 1063958 markings, 5378256 edges, 86982 markings/sec, 5 secs
lola: 1458274 markings, 8445714 edges, 78863 markings/sec, 10 secs
lola: 1826896 markings, 11374464 edges, 73724 markings/sec, 15 secs
lola: 2188029 markings, 14356368 edges, 72227 markings/sec, 20 secs
lola: 2562411 markings, 17310817 edges, 74876 markings/sec, 25 secs
lola: 2893393 markings, 20109518 edges, 66196 markings/sec, 30 secs
lola: 3236754 markings, 22977123 edges, 68672 markings/sec, 35 secs
lola: 3554018 markings, 25766770 edges, 63453 markings/sec, 40 secs
lola: 3922357 markings, 28734396 edges, 73668 markings/sec, 45 secs
lola: 4294286 markings, 31781405 edges, 74386 markings/sec, 50 secs
lola: 4648325 markings, 34734500 edges, 70808 markings/sec, 55 secs
lola: 4962142 markings, 37471921 edges, 62763 markings/sec, 60 secs
lola: 5306476 markings, 40454805 edges, 68867 markings/sec, 65 secs
lola: 5624902 markings, 43178887 edges, 63685 markings/sec, 70 secs
lola: 5933499 markings, 45974296 edges, 61719 markings/sec, 75 secs
lola: 6255552 markings, 48828128 edges, 64411 markings/sec, 80 secs
lola: 6557841 markings, 51645069 edges, 60458 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6682938 markings, 52900558 edges
lola: ========================================
lola: subprocess 5 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p2)))
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: (p2 <= 2)
lola: processed formula length: 9
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: (3 <= p2)
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 / EG
lola: The predicate does not eventually occur.
lola: 162 markings, 216 edges
lola: ========================================
lola: subprocess 6 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p536 <= 0) AND (p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p536 <= 0) AND (p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 <= p0))))
lola: processed formula length: 108
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p536) OR (p0 + 1 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531))
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: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1486 markings, 7018 edges
lola: ========================================
lola: subprocess 7 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p520 + p519 + p518 + p517 + p516 + p515 + p514 + p513 + p512 + p511 + p510 + 1 <= p465 + p464 + p463 + p462 + p461 + p460 + p459 + p458 + p457 + p456 + p455) AND (p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 + 1 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p520 + p519 + p518 + p517 + p516 + p515 + p514 + p513 + p512 + p511 + p510 + 1 <= p465 + p464 + p463 + p462 + p461 + p460 + p459 + p458 + p457 + p456 + p455) AND (p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531 + 1 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454))))
lola: processed formula length: 331
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: ((p465 + p464 + p463 + p462 + p461 + p460 + p459 + p458 + p457 + p456 + p455 <= p520 + p519 + p518 + p517 + p516 + p515 + p514 + p513 + p512 + p511 + p510) OR (p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 <= p527 + p526 + p525 + p524 + p523 + p522 + p521 + p528 + p529 + p530 + p531))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 472352 markings, 2849169 edges, 94470 markings/sec, 0 secs || sara is running 0 secs
lola: 932272 markings, 5818579 edges, 91984 markings/sec, 5 secs || sara is running 5 secs
lola: 1364064 markings, 8736236 edges, 86358 markings/sec, 10 secs || sara is running 10 secs
lola: 1738025 markings, 11199884 edges, 74792 markings/sec, 15 secs || sara is running 15 secs
lola: 2162231 markings, 14095319 edges, 84841 markings/sec, 20 secs || sara is running 20 secs
lola: 2581880 markings, 17017881 edges, 83930 markings/sec, 25 secs || sara is running 25 secs
lola: 2974719 markings, 19892891 edges, 78568 markings/sec, 30 secs || sara is running 30 secs
lola: 3429338 markings, 22835332 edges, 90924 markings/sec, 35 secs || sara is running 35 secs
lola: 3852210 markings, 25744015 edges, 84574 markings/sec, 40 secs || sara is running 40 secs
lola: 4256947 markings, 28613442 edges, 80947 markings/sec, 45 secs || sara is running 45 secs
lola: 4650549 markings, 31431631 edges, 78720 markings/sec, 50 secs || sara is running 50 secs
lola: 5041123 markings, 34214324 edges, 78115 markings/sec, 55 secs || sara is running 55 secs
lola: 5423718 markings, 37025971 edges, 76519 markings/sec, 60 secs || sara is running 60 secs
lola: 5787238 markings, 39784375 edges, 72704 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 8 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (((3 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454) U (3 <= p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367)))))
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 <= p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454) U (3 <= p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367)))
lola: processed formula length: 172
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: 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: 1446327 markings, 3053892 edges, 289265 markings/sec, 0 secs
lola: 2423416 markings, 5421815 edges, 195418 markings/sec, 5 secs
lola: 3205848 markings, 7670098 edges, 156486 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3239140 markings, 7913567 edges
lola: ========================================
lola: subprocess 9 will run for 842 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((1 <= p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389))) OR (1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432))))
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 <= p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389)) OR (1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432)))
lola: processed formula length: 176
lola: 29 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 10 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= 2))) OR (A (F ((p0 <= p377 + p376 + p375 + p374 + p373 + p372 + p371 + p370 + p369 + p368 + p367))) AND (1 <= p538)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p538)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p538)
lola: processed formula length: 11
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 1685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= 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 ((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 <= 2)))
lola: processed formula length: 89
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)
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 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549)
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: 86 markings, 85 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p0 + 1 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499) U (3 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499))) OR E (G ((((p3 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549) AND (p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= p509 + p508 + p507 + p506 + p505 + p504 + p50... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p0 + 1 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499) U (3 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499)))
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 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499) U (3 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499)))
lola: processed formula length: 176
lola: 32 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 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499)
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 /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 3371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p3 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549) AND (p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p3 <= p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549) AND (p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389 <= p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499)))))
lola: processed formula length: 253
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: (((p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + 1 <= p3) OR (p509 + p508 + p507 + p506 + p505 + p504 + p503 + p502 + p501 + p500 + p499 + 1 <= p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 + p390 + p389)))
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-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 402819 markings, 2481991 edges, 80564 markings/sec, 0 secs || sara is running 0 secs
lola: 738056 markings, 5030720 edges, 67047 markings/sec, 5 secs || sara is running 5 secs
lola: 1131371 markings, 7594701 edges, 78663 markings/sec, 10 secs || sara is running 10 secs
lola: 1445252 markings, 10129304 edges, 62776 markings/sec, 15 secs || sara is running 15 secs
lola: 1811771 markings, 12634337 edges, 73304 markings/sec, 20 secs || sara is running 20 secs
lola: 2165772 markings, 14977480 edges, 70800 markings/sec, 25 secs || sara is running 25 secs
lola: 2481342 markings, 17453993 edges, 63114 markings/sec, 30 secs || sara is running 30 secs
lola: 2775427 markings, 19860777 edges, 58817 markings/sec, 35 secs || sara is running 35 secs
lola: 3012170 markings, 22093946 edges, 47349 markings/sec, 40 secs || sara is running 40 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 12 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p20... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220... (shortened)
lola: processed formula length: 1049
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E ((((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p20... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432) OR (p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220... (shortened)
lola: processed formula length: 1049
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p147 + p158 + p169 + p180 + p191 + p202 + p213 + p224 + p235 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208... (shortened)
lola: processed formula length: 1109
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: (p498 + p497 + p496 + p495 + p494 + p493 + p492 + p491 + p490 + p489 + p488 + 1 <= p487 + p486 + p485 + p484 + p483 + p482 + p481 + p480 + p479 + p478 + p477)
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-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 356141 markings, 2533772 edges, 71228 markings/sec, 0 secs
lola: sara is running 5 secs || 654606 markings, 4808809 edges, 59693 markings/sec, 5 secs
lola: sara is running 10 secs || 962667 markings, 7212223 edges, 61612 markings/sec, 10 secs
lola: sara is running 15 secs || 1284541 markings, 9793383 edges, 64375 markings/sec, 15 secs
lola: sara is running 20 secs || 1590329 markings, 12328303 edges, 61158 markings/sec, 20 secs
lola: sara is running 25 secs || 1895718 markings, 14746865 edges, 61078 markings/sec, 25 secs
lola: sara is running 30 secs || 2172227 markings, 17000480 edges, 55302 markings/sec, 30 secs
lola: sara is running 35 secs || 2451419 markings, 19334463 edges, 55838 markings/sec, 35 secs
lola: sara is running 40 secs || 2753502 markings, 21920596 edges, 60417 markings/sec, 40 secs
lola: sara is running 45 secs || 3033497 markings, 24461068 edges, 55999 markings/sec, 45 secs
lola: sara is running 50 secs || 3374114 markings, 27100656 edges, 68123 markings/sec, 50 secs
lola: sara is running 55 secs || 3692494 markings, 29711284 edges, 63676 markings/sec, 55 secs
lola: sara is running 60 secs || 3988744 markings, 32193800 edges, 59250 markings/sec, 60 secs
lola: sara is running 65 secs || 4257209 markings, 34486456 edges, 53693 markings/sec, 65 secs
lola: sara is running 70 secs || 4508931 markings, 36739091 edges, 50344 markings/sec, 70 secs
lola: sara is running 75 secs || 4778244 markings, 39006563 edges, 53863 markings/sec, 75 secs
lola: sara is running 80 secs || 5061060 markings, 41436773 edges, 56563 markings/sec, 80 secs
lola: sara is running 85 secs || 5321398 markings, 43817740 edges, 52068 markings/sec, 85 secs
lola: sara is running 90 secs || 5600594 markings, 46257507 edges, 55839 markings/sec, 90 secs
lola: sara is running 95 secs || 5846642 markings, 48528477 edges, 49210 markings/sec, 95 secs
lola: sara is running 100 secs || 6063592 markings, 50630832 edges, 43390 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 6091114 markings, 50918312 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 no no no no no no
lola:
preliminary result: yes no yes no yes no no no no no no no no
lola: memory consumption: 25892 KB
lola: time consumption: 351 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-COL-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-COL-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-158987872300739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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