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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 20K Apr 12 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 12 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 246K Apr 11 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 701K Apr 11 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 743K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 10 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 10 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 9 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 9 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 18M 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 PolyORBNT-PT-S10J40-CTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J40-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591175782792

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 09:16:25] [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 09:16:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 09:16:26] [INFO ] Load time of PNML (sax parser for PT used): 827 ms
[2020-06-03 09:16:26] [INFO ] Transformed 854 places.
[2020-06-03 09:16:26] [INFO ] Transformed 12340 transitions.
[2020-06-03 09:16:26] [INFO ] Parsed PT model containing 854 places and 12340 transitions in 1152 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 332 ms.
Incomplete random walk after 100000 steps, including 5602 resets, run finished after 3921 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 09:16:30] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2020-06-03 09:16:30] [INFO ] Computed 112 place invariants in 231 ms
[2020-06-03 09:16:31] [INFO ] [Real]Absence check using 81 positive place invariants in 151 ms returned sat
[2020-06-03 09:16:31] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 76 ms returned sat
[2020-06-03 09:16:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:16:37] [INFO ] [Real]Absence check using state equation in 5363 ms returned sat
[2020-06-03 09:16:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:16:37] [INFO ] [Nat]Absence check using 81 positive place invariants in 71 ms returned sat
[2020-06-03 09:16:37] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 55 ms returned sat
[2020-06-03 09:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:16:46] [INFO ] [Nat]Absence check using state equation in 8591 ms returned sat
[2020-06-03 09:16:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 09:16:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 208 ms returned sat
[2020-06-03 09:16:47] [INFO ] Deduced a trap composed of 24 places in 732 ms
[2020-06-03 09:16:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 958 ms
[2020-06-03 09:16:48] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 415 ms.
[2020-06-03 09:16:51] [INFO ] Added : 5 causal constraints over 1 iterations in 3869 ms. Result :sat
[2020-06-03 09:16:52] [INFO ] Deduced a trap composed of 109 places in 523 ms
[2020-06-03 09:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1103 ms
[2020-06-03 09:16:52] [INFO ] [Real]Absence check using 81 positive place invariants in 64 ms returned sat
[2020-06-03 09:16:52] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 55 ms returned sat
[2020-06-03 09:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:16:59] [INFO ] [Real]Absence check using state equation in 6554 ms returned sat
[2020-06-03 09:16:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:16:59] [INFO ] [Nat]Absence check using 81 positive place invariants in 48 ms returned sat
[2020-06-03 09:16:59] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 47 ms returned sat
[2020-06-03 09:16:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:17:07] [INFO ] [Nat]Absence check using state equation in 8256 ms returned sat
[2020-06-03 09:17:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 900 ms returned sat
[2020-06-03 09:17:09] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 323 ms.
[2020-06-03 09:17:19] [INFO ] Added : 70 causal constraints over 14 iterations in 10636 ms. Result :unknown
[2020-06-03 09:17:19] [INFO ] [Real]Absence check using 81 positive place invariants in 49 ms returned sat
[2020-06-03 09:17:19] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 37 ms returned sat
[2020-06-03 09:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:17:24] [INFO ] [Real]Absence check using state equation in 5301 ms returned sat
[2020-06-03 09:17:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:17:25] [INFO ] [Nat]Absence check using 81 positive place invariants in 59 ms returned sat
[2020-06-03 09:17:25] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 57 ms returned sat
[2020-06-03 09:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:17:30] [INFO ] [Nat]Absence check using state equation in 4981 ms returned sat
[2020-06-03 09:17:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:17:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 3726 ms returned sat
[2020-06-03 09:17:34] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 265 ms.
[2020-06-03 09:17:45] [INFO ] Added : 45 causal constraints over 9 iterations in 11020 ms. Result :unknown
[2020-06-03 09:17:45] [INFO ] [Real]Absence check using 81 positive place invariants in 62 ms returned sat
[2020-06-03 09:17:45] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 38 ms returned sat
[2020-06-03 09:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:17:51] [INFO ] [Real]Absence check using state equation in 6397 ms returned sat
[2020-06-03 09:17:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:17:51] [INFO ] [Nat]Absence check using 81 positive place invariants in 64 ms returned sat
[2020-06-03 09:17:51] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 54 ms returned sat
[2020-06-03 09:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:18:01] [INFO ] [Nat]Absence check using state equation in 9178 ms returned sat
[2020-06-03 09:18:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 262 ms returned sat
[2020-06-03 09:18:01] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 296 ms.
[2020-06-03 09:18:11] [INFO ] Added : 30 causal constraints over 6 iterations in 10320 ms. Result :unknown
[2020-06-03 09:18:11] [INFO ] [Real]Absence check using 81 positive place invariants in 99 ms returned sat
[2020-06-03 09:18:11] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 79 ms returned sat
[2020-06-03 09:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:18:17] [INFO ] [Real]Absence check using state equation in 5311 ms returned sat
[2020-06-03 09:18:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:18:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 62 ms returned sat
[2020-06-03 09:18:17] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 57 ms returned sat
[2020-06-03 09:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:18:28] [INFO ] [Nat]Absence check using state equation in 10579 ms returned sat
[2020-06-03 09:18:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 700 ms returned sat
[2020-06-03 09:18:29] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 334 ms.
[2020-06-03 09:18:34] [INFO ] Added : 5 causal constraints over 1 iterations in 5256 ms. Result :sat
[2020-06-03 09:18:34] [INFO ] [Real]Absence check using 81 positive place invariants in 73 ms returned sat
[2020-06-03 09:18:34] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 43 ms returned sat
[2020-06-03 09:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:18:40] [INFO ] [Real]Absence check using state equation in 5523 ms returned sat
[2020-06-03 09:18:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:18:40] [INFO ] [Nat]Absence check using 81 positive place invariants in 77 ms returned sat
[2020-06-03 09:18:40] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 69 ms returned sat
[2020-06-03 09:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:18:46] [INFO ] [Nat]Absence check using state equation in 6062 ms returned sat
[2020-06-03 09:18:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 143 ms returned sat
[2020-06-03 09:18:47] [INFO ] Deduced a trap composed of 289 places in 1014 ms
[2020-06-03 09:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1127 ms
[2020-06-03 09:18:47] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 251 ms.
[2020-06-03 09:18:55] [INFO ] Added : 10 causal constraints over 2 iterations in 7737 ms. Result :unknown
[2020-06-03 09:18:55] [INFO ] [Real]Absence check using 81 positive place invariants in 63 ms returned sat
[2020-06-03 09:18:55] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 24 ms returned unsat
[2020-06-03 09:18:55] [INFO ] [Real]Absence check using 81 positive place invariants in 60 ms returned sat
[2020-06-03 09:18:55] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 50 ms returned sat
[2020-06-03 09:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:19:00] [INFO ] [Real]Absence check using state equation in 4137 ms returned sat
[2020-06-03 09:19:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:19:00] [INFO ] [Nat]Absence check using 81 positive place invariants in 59 ms returned sat
[2020-06-03 09:19:00] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 59 ms returned sat
[2020-06-03 09:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:19:04] [INFO ] [Nat]Absence check using state equation in 4630 ms returned sat
[2020-06-03 09:19:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2020-06-03 09:19:05] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 325 ms.
[2020-06-03 09:19:16] [INFO ] Added : 25 causal constraints over 5 iterations in 11240 ms. Result :sat
[2020-06-03 09:19:17] [INFO ] Deduced a trap composed of 19 places in 1048 ms
[2020-06-03 09:19:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1756 ms
[2020-06-03 09:19:18] [INFO ] [Real]Absence check using 81 positive place invariants in 59 ms returned sat
[2020-06-03 09:19:18] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 44 ms returned unsat
[2020-06-03 09:19:18] [INFO ] [Real]Absence check using 81 positive place invariants in 63 ms returned sat
[2020-06-03 09:19:18] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 49 ms returned sat
[2020-06-03 09:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:19:24] [INFO ] [Real]Absence check using state equation in 5714 ms returned sat
[2020-06-03 09:19:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:19:24] [INFO ] [Nat]Absence check using 81 positive place invariants in 66 ms returned sat
[2020-06-03 09:19:24] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 49 ms returned sat
[2020-06-03 09:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:19:28] [INFO ] [Nat]Absence check using state equation in 4417 ms returned sat
[2020-06-03 09:19:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 163 ms returned sat
[2020-06-03 09:19:30] [INFO ] Deduced a trap composed of 24 places in 815 ms
[2020-06-03 09:19:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 977 ms
[2020-06-03 09:19:30] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 298 ms.
[2020-06-03 09:19:39] [INFO ] Added : 30 causal constraints over 6 iterations in 9535 ms. Result :sat
[2020-06-03 09:19:40] [INFO ] Deduced a trap composed of 19 places in 564 ms
[2020-06-03 09:19:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1179 ms
[2020-06-03 09:19:41] [INFO ] [Real]Absence check using 81 positive place invariants in 59 ms returned sat
[2020-06-03 09:19:41] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 56 ms returned sat
[2020-06-03 09:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:19:46] [INFO ] [Real]Absence check using state equation in 5231 ms returned sat
[2020-06-03 09:19:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:19:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 63 ms returned sat
[2020-06-03 09:19:46] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 53 ms returned sat
[2020-06-03 09:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:19:50] [INFO ] [Nat]Absence check using state equation in 3566 ms returned sat
[2020-06-03 09:19:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2020-06-03 09:19:50] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 286 ms.
[2020-06-03 09:20:06] [INFO ] Added : 225 causal constraints over 45 iterations in 16134 ms. Result :unknown
[2020-06-03 09:20:06] [INFO ] [Real]Absence check using 81 positive place invariants in 58 ms returned sat
[2020-06-03 09:20:06] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 51 ms returned sat
[2020-06-03 09:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:20:10] [INFO ] [Real]Absence check using state equation in 4242 ms returned sat
[2020-06-03 09:20:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:20:11] [INFO ] [Nat]Absence check using 81 positive place invariants in 62 ms returned sat
[2020-06-03 09:20:11] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 60 ms returned sat
[2020-06-03 09:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:20:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:20:25] [INFO ] [Nat]Absence check using state equation in 14787 ms returned unknown
[2020-06-03 09:20:26] [INFO ] [Real]Absence check using 81 positive place invariants in 67 ms returned sat
[2020-06-03 09:20:26] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 71 ms returned sat
[2020-06-03 09:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:20:31] [INFO ] [Real]Absence check using state equation in 5444 ms returned sat
[2020-06-03 09:20:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:20:31] [INFO ] [Nat]Absence check using 81 positive place invariants in 65 ms returned sat
[2020-06-03 09:20:31] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 69 ms returned sat
[2020-06-03 09:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:20:36] [INFO ] [Nat]Absence check using state equation in 4384 ms returned sat
[2020-06-03 09:20:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:20:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 6007 ms returned unknown
[2020-06-03 09:20:42] [INFO ] [Real]Absence check using 81 positive place invariants in 59 ms returned sat
[2020-06-03 09:20:42] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 54 ms returned sat
[2020-06-03 09:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:20:46] [INFO ] [Real]Absence check using state equation in 4232 ms returned sat
[2020-06-03 09:20:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:20:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 62 ms returned sat
[2020-06-03 09:20:47] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 54 ms returned sat
[2020-06-03 09:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:20:51] [INFO ] [Nat]Absence check using state equation in 4369 ms returned sat
[2020-06-03 09:20:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2020-06-03 09:20:52] [INFO ] Deduced a trap composed of 24 places in 1235 ms
[2020-06-03 09:20:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1585 ms
[2020-06-03 09:20:53] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 287 ms.
[2020-06-03 09:21:03] [INFO ] Added : 20 causal constraints over 4 iterations in 10838 ms. Result :sat
[2020-06-03 09:21:04] [INFO ] Deduced a trap composed of 19 places in 598 ms
[2020-06-03 09:21:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:21:07] [INFO ] Deduced a trap composed of 3 places in 1050 ms
[2020-06-03 09:21:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s379 s684 s688) 0)") while checking expression at index 13
[2020-06-03 09:21:08] [INFO ] [Real]Absence check using 81 positive place invariants in 40 ms returned sat
[2020-06-03 09:21:08] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 38 ms returned unsat
[2020-06-03 09:21:08] [INFO ] [Real]Absence check using 81 positive place invariants in 62 ms returned sat
[2020-06-03 09:21:08] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 71 ms returned sat
[2020-06-03 09:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:21:12] [INFO ] [Real]Absence check using state equation in 4495 ms returned sat
[2020-06-03 09:21:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:21:12] [INFO ] [Nat]Absence check using 81 positive place invariants in 45 ms returned sat
[2020-06-03 09:21:13] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 54 ms returned sat
[2020-06-03 09:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:21:19] [INFO ] [Nat]Absence check using state equation in 6897 ms returned sat
[2020-06-03 09:21:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:21:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 4585 ms returned sat
[2020-06-03 09:21:24] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 280 ms.
[2020-06-03 09:21:32] [INFO ] Added : 15 causal constraints over 3 iterations in 8172 ms. Result :unknown
[2020-06-03 09:21:32] [INFO ] [Real]Absence check using 81 positive place invariants in 58 ms returned sat
[2020-06-03 09:21:32] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 56 ms returned sat
[2020-06-03 09:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:21:38] [INFO ] [Real]Absence check using state equation in 5674 ms returned sat
[2020-06-03 09:21:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:21:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 61 ms returned sat
[2020-06-03 09:21:38] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 54 ms returned sat
[2020-06-03 09:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:21:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:21:52] [INFO ] [Nat]Absence check using state equation in 13497 ms returned unknown
[2020-06-03 09:21:52] [INFO ] [Real]Absence check using 81 positive place invariants in 60 ms returned sat
[2020-06-03 09:21:52] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 53 ms returned sat
[2020-06-03 09:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:21:56] [INFO ] [Real]Absence check using state equation in 4063 ms returned sat
[2020-06-03 09:21:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:21:57] [INFO ] [Nat]Absence check using 81 positive place invariants in 346 ms returned sat
[2020-06-03 09:21:57] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 43 ms returned sat
[2020-06-03 09:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:22:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 09:22:08] [INFO ] [Nat]Absence check using state equation in 11737 ms returned unknown
[2020-06-03 09:22:09] [INFO ] [Real]Absence check using 81 positive place invariants in 59 ms returned sat
[2020-06-03 09:22:09] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 52 ms returned sat
[2020-06-03 09:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:22:14] [INFO ] [Real]Absence check using state equation in 5485 ms returned sat
[2020-06-03 09:22:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:22:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 60 ms returned sat
[2020-06-03 09:22:15] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 52 ms returned sat
[2020-06-03 09:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:22:26] [INFO ] [Nat]Absence check using state equation in 11671 ms returned sat
[2020-06-03 09:22:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 338 ms returned sat
[2020-06-03 09:22:28] [INFO ] Deduced a trap composed of 371 places in 993 ms
[2020-06-03 09:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1169 ms
[2020-06-03 09:22:28] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 320 ms.
[2020-06-03 09:22:34] [INFO ] Added : 5 causal constraints over 1 iterations in 6491 ms. Result :unknown
[2020-06-03 09:22:34] [INFO ] [Real]Absence check using 81 positive place invariants in 65 ms returned sat
[2020-06-03 09:22:34] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 53 ms returned sat
[2020-06-03 09:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:22:42] [INFO ] [Real]Absence check using state equation in 7375 ms returned sat
[2020-06-03 09:22:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:22:42] [INFO ] [Nat]Absence check using 81 positive place invariants in 61 ms returned sat
[2020-06-03 09:22:42] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 51 ms returned sat
[2020-06-03 09:22:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:22:47] [INFO ] [Nat]Absence check using state equation in 5005 ms returned sat
[2020-06-03 09:22:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 223 ms returned sat
[2020-06-03 09:22:48] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 394 ms.
[2020-06-03 09:22:52] [INFO ] Added : 5 causal constraints over 1 iterations in 4457 ms. Result :sat
[2020-06-03 09:22:53] [INFO ] Deduced a trap composed of 109 places in 1130 ms
[2020-06-03 09:22:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1409 ms
[2020-06-03 09:22:53] [INFO ] [Real]Absence check using 81 positive place invariants in 58 ms returned sat
[2020-06-03 09:22:53] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 39 ms returned sat
[2020-06-03 09:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:22:59] [INFO ] [Real]Absence check using state equation in 5080 ms returned sat
[2020-06-03 09:22:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:22:59] [INFO ] [Nat]Absence check using 81 positive place invariants in 98 ms returned sat
[2020-06-03 09:22:59] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 58 ms returned sat
[2020-06-03 09:22:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:23:04] [INFO ] [Nat]Absence check using state equation in 4775 ms returned sat
[2020-06-03 09:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2020-06-03 09:23:04] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 185 ms.
[2020-06-03 09:23:15] [INFO ] Added : 20 causal constraints over 4 iterations in 10763 ms. Result :unknown
[2020-06-03 09:23:15] [INFO ] [Real]Absence check using 81 positive place invariants in 46 ms returned unsat
[2020-06-03 09:23:15] [INFO ] [Real]Absence check using 81 positive place invariants in 51 ms returned sat
[2020-06-03 09:23:15] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 46 ms returned sat
[2020-06-03 09:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:23:20] [INFO ] [Real]Absence check using state equation in 4719 ms returned sat
[2020-06-03 09:23:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:23:20] [INFO ] [Nat]Absence check using 81 positive place invariants in 61 ms returned sat
[2020-06-03 09:23:20] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 57 ms returned sat
[2020-06-03 09:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:23:26] [INFO ] [Nat]Absence check using state equation in 6075 ms returned sat
[2020-06-03 09:23:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 423 ms returned sat
[2020-06-03 09:23:27] [INFO ] Deduced a trap composed of 145 places in 795 ms
[2020-06-03 09:23:28] [INFO ] Deduced a trap composed of 24 places in 666 ms
[2020-06-03 09:23:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1734 ms
[2020-06-03 09:23:28] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 242 ms.
[2020-06-03 09:23:40] [INFO ] Added : 60 causal constraints over 12 iterations in 11568 ms. Result :unknown
[2020-06-03 09:23:40] [INFO ] [Real]Absence check using 81 positive place invariants in 60 ms returned sat
[2020-06-03 09:23:40] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 53 ms returned sat
[2020-06-03 09:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:23:44] [INFO ] [Real]Absence check using state equation in 4519 ms returned sat
[2020-06-03 09:23:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:23:45] [INFO ] [Nat]Absence check using 81 positive place invariants in 40 ms returned sat
[2020-06-03 09:23:45] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 42 ms returned sat
[2020-06-03 09:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:23:49] [INFO ] [Nat]Absence check using state equation in 3995 ms returned sat
[2020-06-03 09:23:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2020-06-03 09:23:49] [INFO ] Deduced a trap composed of 185 places in 793 ms
[2020-06-03 09:23:50] [INFO ] Deduced a trap composed of 24 places in 758 ms
[2020-06-03 09:23:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2503 ms
[2020-06-03 09:23:51] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 192 ms.
[2020-06-03 09:23:57] [INFO ] Added : 20 causal constraints over 4 iterations in 5466 ms. Result :sat
[2020-06-03 09:23:57] [INFO ] Deduced a trap composed of 19 places in 502 ms
[2020-06-03 09:23:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1305 ms
[2020-06-03 09:23:58] [INFO ] [Real]Absence check using 81 positive place invariants in 57 ms returned unsat
[2020-06-03 09:23:58] [INFO ] [Real]Absence check using 81 positive place invariants in 69 ms returned sat
[2020-06-03 09:23:58] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 57 ms returned sat
[2020-06-03 09:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:24:03] [INFO ] [Real]Absence check using state equation in 4266 ms returned sat
[2020-06-03 09:24:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:24:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 42 ms returned sat
[2020-06-03 09:24:03] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 40 ms returned sat
[2020-06-03 09:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:24:10] [INFO ] [Nat]Absence check using state equation in 7532 ms returned sat
[2020-06-03 09:24:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2020-06-03 09:24:11] [INFO ] Deduced a trap composed of 24 places in 792 ms
[2020-06-03 09:24:12] [INFO ] Deduced a trap composed of 104 places in 785 ms
[2020-06-03 09:24:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1786 ms
[2020-06-03 09:24:12] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 229 ms.
[2020-06-03 09:24:23] [INFO ] Added : 65 causal constraints over 13 iterations in 10513 ms. Result :unknown
[2020-06-03 09:24:23] [INFO ] [Real]Absence check using 81 positive place invariants in 51 ms returned unsat
[2020-06-03 09:24:23] [INFO ] [Real]Absence check using 81 positive place invariants in 39 ms returned sat
[2020-06-03 09:24:23] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 38 ms returned sat
[2020-06-03 09:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:24:28] [INFO ] [Real]Absence check using state equation in 4926 ms returned sat
[2020-06-03 09:24:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:24:28] [INFO ] [Nat]Absence check using 81 positive place invariants in 75 ms returned sat
[2020-06-03 09:24:28] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 55 ms returned sat
[2020-06-03 09:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:24:32] [INFO ] [Nat]Absence check using state equation in 3700 ms returned sat
[2020-06-03 09:24:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2020-06-03 09:24:32] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 252 ms.
[2020-06-03 09:24:48] [INFO ] Added : 255 causal constraints over 51 iterations in 16091 ms. Result :(error "Failed to check-sat")
[2020-06-03 09:24:48] [INFO ] [Real]Absence check using 81 positive place invariants in 78 ms returned sat
[2020-06-03 09:24:48] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 52 ms returned sat
[2020-06-03 09:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:24:53] [INFO ] [Real]Absence check using state equation in 4822 ms returned sat
[2020-06-03 09:24:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:24:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 87 ms returned sat
[2020-06-03 09:24:53] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 37 ms returned sat
[2020-06-03 09:24:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:25:01] [INFO ] [Nat]Absence check using state equation in 7696 ms returned sat
[2020-06-03 09:25:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1567 ms returned sat
[2020-06-03 09:25:03] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 236 ms.
[2020-06-03 09:25:13] [INFO ] Added : 55 causal constraints over 11 iterations in 10412 ms. Result :unknown
[2020-06-03 09:25:13] [INFO ] [Real]Absence check using 81 positive place invariants in 46 ms returned sat
[2020-06-03 09:25:13] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 4 ms returned unsat
[2020-06-03 09:25:13] [INFO ] [Real]Absence check using 81 positive place invariants in 58 ms returned sat
[2020-06-03 09:25:13] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 53 ms returned sat
[2020-06-03 09:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:25:18] [INFO ] [Real]Absence check using state equation in 4377 ms returned sat
[2020-06-03 09:25:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:25:18] [INFO ] [Nat]Absence check using 81 positive place invariants in 65 ms returned sat
[2020-06-03 09:25:18] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 50 ms returned sat
[2020-06-03 09:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:25:23] [INFO ] [Nat]Absence check using state equation in 4755 ms returned sat
[2020-06-03 09:25:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 56 ms returned sat
[2020-06-03 09:25:24] [INFO ] Deduced a trap composed of 24 places in 716 ms
[2020-06-03 09:25:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 827 ms
[2020-06-03 09:25:24] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 191 ms.
[2020-06-03 09:25:32] [INFO ] Added : 15 causal constraints over 3 iterations in 8537 ms. Result :sat
[2020-06-03 09:25:33] [INFO ] Deduced a trap composed of 19 places in 449 ms
[2020-06-03 09:25:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2074 ms
[2020-06-03 09:25:34] [INFO ] [Real]Absence check using 81 positive place invariants in 58 ms returned sat
[2020-06-03 09:25:35] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 51 ms returned sat
[2020-06-03 09:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:25:40] [INFO ] [Real]Absence check using state equation in 5264 ms returned sat
[2020-06-03 09:25:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:25:40] [INFO ] [Nat]Absence check using 81 positive place invariants in 54 ms returned sat
[2020-06-03 09:25:40] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 57 ms returned sat
[2020-06-03 09:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:25:46] [INFO ] [Nat]Absence check using state equation in 6188 ms returned sat
[2020-06-03 09:25:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 39 ms returned sat
[2020-06-03 09:25:47] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 272 ms.
[2020-06-03 09:25:56] [INFO ] Added : 20 causal constraints over 4 iterations in 9173 ms. Result :unknown
[2020-06-03 09:25:56] [INFO ] [Real]Absence check using 81 positive place invariants in 58 ms returned sat
[2020-06-03 09:25:56] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 52 ms returned sat
[2020-06-03 09:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:26:01] [INFO ] [Real]Absence check using state equation in 4726 ms returned sat
[2020-06-03 09:26:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:26:01] [INFO ] [Nat]Absence check using 81 positive place invariants in 62 ms returned sat
[2020-06-03 09:26:01] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 55 ms returned sat
[2020-06-03 09:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:26:05] [INFO ] [Nat]Absence check using state equation in 4548 ms returned sat
[2020-06-03 09:26:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 572 ms returned sat
[2020-06-03 09:26:06] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 250 ms.
[2020-06-03 09:26:16] [INFO ] Added : 15 causal constraints over 3 iterations in 10093 ms. Result :unknown
[2020-06-03 09:26:16] [INFO ] [Real]Absence check using 81 positive place invariants in 64 ms returned sat
[2020-06-03 09:26:16] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 73 ms returned sat
[2020-06-03 09:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:26:21] [INFO ] [Real]Absence check using state equation in 4279 ms returned sat
[2020-06-03 09:26:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:26:21] [INFO ] [Nat]Absence check using 81 positive place invariants in 63 ms returned sat
[2020-06-03 09:26:21] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 75 ms returned sat
[2020-06-03 09:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:26:28] [INFO ] [Nat]Absence check using state equation in 6612 ms returned sat
[2020-06-03 09:26:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2020-06-03 09:26:28] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 253 ms.
[2020-06-03 09:26:41] [INFO ] Added : 120 causal constraints over 24 iterations in 13049 ms. Result :unknown
[2020-06-03 09:26:41] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned unsat
[2020-06-03 09:26:41] [INFO ] [Real]Absence check using 81 positive place invariants in 16 ms returned unsat
[2020-06-03 09:26:41] [INFO ] [Real]Absence check using 81 positive place invariants in 60 ms returned sat
[2020-06-03 09:26:41] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 53 ms returned sat
[2020-06-03 09:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:26:46] [INFO ] [Real]Absence check using state equation in 4441 ms returned sat
[2020-06-03 09:26:46] [INFO ] [Real]Added 1 Read/Feed constraints in 43 ms returned sat
[2020-06-03 09:26:46] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 219 ms.
[2020-06-03 09:26:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:26:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 57 ms returned sat
[2020-06-03 09:26:47] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 51 ms returned sat
[2020-06-03 09:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:26:51] [INFO ] [Nat]Absence check using state equation in 3730 ms returned sat
[2020-06-03 09:26:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2020-06-03 09:26:51] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 183 ms.
[2020-06-03 09:27:07] [INFO ] Added : 310 causal constraints over 62 iterations in 15966 ms. Result :unknown
[2020-06-03 09:27:07] [INFO ] [Real]Absence check using 81 positive place invariants in 61 ms returned sat
[2020-06-03 09:27:07] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 47 ms returned sat
[2020-06-03 09:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:27:14] [INFO ] [Real]Absence check using state equation in 7057 ms returned sat
[2020-06-03 09:27:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:27:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 62 ms returned sat
[2020-06-03 09:27:14] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 52 ms returned sat
[2020-06-03 09:27:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:27:22] [INFO ] [Nat]Absence check using state equation in 7405 ms returned sat
[2020-06-03 09:27:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 732 ms returned sat
[2020-06-03 09:27:23] [INFO ] Deduced a trap composed of 24 places in 798 ms
[2020-06-03 09:27:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 940 ms
[2020-06-03 09:27:24] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 382 ms.
[2020-06-03 09:27:34] [INFO ] Added : 55 causal constraints over 11 iterations in 10736 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 09:27:34] [INFO ] [Real]Absence check using 81 positive place invariants in 43 ms returned sat
[2020-06-03 09:27:34] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 39 ms returned sat
[2020-06-03 09:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:27:40] [INFO ] [Real]Absence check using state equation in 5315 ms returned sat
[2020-06-03 09:27:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:27:40] [INFO ] [Nat]Absence check using 81 positive place invariants in 61 ms returned sat
[2020-06-03 09:27:40] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 56 ms returned sat
[2020-06-03 09:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:27:45] [INFO ] [Nat]Absence check using state equation in 4949 ms returned sat
[2020-06-03 09:27:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 335 ms returned sat
[2020-06-03 09:27:46] [INFO ] Computed and/alt/rep : 2219/131222/2210 causal constraints in 306 ms.
[2020-06-03 09:27:50] [INFO ] Added : 5 causal constraints over 1 iterations in 4923 ms. Result :sat
[2020-06-03 09:27:51] [INFO ] Deduced a trap composed of 20 places in 385 ms
[2020-06-03 09:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1255 ms
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-06-03 09:27:52] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 09:27:52] [INFO ] Flatten gal took : 392 ms
[2020-06-03 09:27:52] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 09:27:52] [INFO ] Flatten gal took : 208 ms
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 09:27:52] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2020-06-03 09:27:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBNT-PT-S10J40 @ 3570 seconds

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S10J40-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3315
rslt: Output for CTLCardinality @ PolyORBNT-PT-S10J40

{
"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 09:27:53 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 413,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 413,
"visible_transitions": 0
},
"processed": "((p305 <= 0) AND ((p2 + p4 + p5 + p9 + p106 + p109 + p110 + p111 + p115 + p116 + p118 + p119 + p120 + p122 + p127 + p134 + p137 + p138 + p139 + p142 + p143 + p145 + p150 + p151 + p152 + p154 + p155 + p158 + p161 + p162 + p164 + p168 + p169 + p170 + p171 + p173 + p174 + p176 + p178 + p179 + p181 + p185 + p186 + p187 + p188 + p189 + p191 + p192 + p195 + p196 + p197 + p199 + p200 + p208 + p209 + p214 + p215 + p216 + p218 + p219 + p220 + p223 + p224 + p226 + p229 + p230 + p233 + p234 + p236 + p237 + p238 + p240 + p243 + p244 + p247 + p249 + p250 + p252 + p254 + p259 + p260 + p261 + p262 + p263 + p266 + p267 + p269 + p271 + p272 + p273 + p277 + p278 + p280 + p281 + p282 + p283 + p287 + p288 + p291 + p296 + p300 + p304 + p307 + p309 + p310 + p311 + p315 + p317 + p318 + p320 + p321 + p323 + p326 + p328 + p330 + p333 + p335 + p336 + p337 + p339 + p341 + p347 + p351 + p354 + p358 + p360 + p361 + p362 + p364 + p366 + p367 + p370 + p372 + p374 + p375 + p376 + p378 + p381 + p382 + p383 + p384 + p385 + p388 + p389 + p391 + p392 + p393 + p395 + p396 + p397 + p402 + p403 + p407 + p408 + p409 + p414 + p417 + p424 + p425 + p426 + p429 + p430 + p431 + p434 + p436 + p439 + p442 + p28 + p447 + p448 + p449 + p451 + p454 + p455 + p457 + p458 + p459 + p460 + p462 + p463 + p464 + p466 + p471 + p472 + p475 + p476 + p477 + p480 + p482 + p484 + p27 + p487 + p488 + p492 + p495 + p497 + p498 + p502 + p504 + p505 + p506 + p509 + p510 + p511 + p513 + p515 + p517 + p519 + p520 + p521 + p522 + p527 + p532 + p533 + p534 + p535 + p539 + p540 + p541 + p543 + p546 + p547 + p548 + p549 + p550 + p551 + p553 + p555 + p559 + p561 + p569 + p572 + p573 + p575 + p576 + p579 + p580 + p581 + p583 + p585 + p587 + p588 + p589 + p590 + p593 + p594 + p595 + p596 + p598 + p599 + p600 + p602 + p605 + p606 + p608 + p609 + p612 + p614 + p619 + p620 + p624 + p625 + p626 + p627 + p630 + p631 + p633 + p634 + p636 + p643 + p649 + p652 + p653 + p655 + p656 + p657 + p659 + p660 + p664 + p666 + p667 + p671 + p672 + p673 + p676 + p677 + p679 + p680 + p681 + p682 + p683 + p685 + p686 + p19 + p691 + p697 + p698 + p700 + p701 + p704 + p705 + p706 + p709 + p711 + p714 + p718 + p719 + p720 + p721 + p722 + p725 + p726 + p728 + p729 + p730 + p16 + p732 + p738 + p741 + p742 + p743 + p745 + p12 + p754 + p757 + p762 + p849 + p764 + p765 + p766 + p767 + p768 + p770 + p772 + p777 + p779 + p782 + p783 + p785 + p786 + p788 + p789 + p790 + p792 + p795 + p796 + p799 + p804 + p840 + p807 + p838 + p812 + p814 + p818 + p819 + p820 + p821 + p823 + p824 + p826 + p827 + p829 + p836 + p810 + p802 + p842 + p843 + p763 + p759 + p851 + p752 + p11 + p13 + p746 + p15 + p18 + p22 + p485 + p31 + p32 + p34 + p36 + p37 + p38 + p39 + p41 + p43 + p47 + p51 + p53 + p54 + p59 + p61 + p67 + p68 + p69 + p75 + p76 + p77 + p78 + p79 + p81 + p82 + p86 + p87 + p88 + p89 + p90 + p93 + p98 <= 2) OR (p771 <= p756)))",
"processed_size": 2863,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 414
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 53,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 53,
"visible_transitions": 0
},
"processed": "AX(((p423 + 1 <= p6 + p128 + p193 + p303 + p404 + p508 + p545 + p648 + p644 + p235) OR (p305 + 1 <= p105 + p117 + p124 + p156 + p182 + p222 + p245 + p246 + p258 + p276 + p293 + p306 + p334 + p345 + p433 + p435 + p452 + p453 + p486 + p491 + p503 + p542 + p558 + p562 + p586 + p610 + p616 + p632 + p674 + p694 + p740 + p744 + p10 + p760 + p848 + p817 + p822 + p801 + p58 + p73 + p83)))",
"processed_size": 384,
"rewrites": 19
},
"net":
{
"conflict_clusters": 144,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 82,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 82,
"visible_transitions": 0
},
"processed": "AF((EX((3 <= p113 + p132 + p146 + p148 + p190 + p231 + p239 + p275 + p292 + p314 + p327 + p33 + p344 + p353 + p371 + p413 + p450 + p481 + p489 + p528 + p554 + p557 + p577 + p592 + p603 + p621 + p635 + p645 + p675 + p715 + p716 + p733 + p14 + p852 + p775 + p845 + p800 + p731 + p66 + p72 + p84)) OR EF((2 <= p0 + p102 + p141 + p144 + p147 + p163 + p184 + p206 + p207 + p221 + p242 + p274 + p301 + p387 + p399 + p410 + p465 + p468 + p514 + p525 + p536 + p537 + p544 + p563 + p568 + p571 + p601 + p622 + p628 + p678 + p717 + p739 + p749 + p761 + p769 + p750 + p42 + p46 + p56 + p71 + p97))))",
"processed_size": 588,
"rewrites": 21
},
"net":
{
"conflict_clusters": 144,
"singleton_clusters": 0
},
"result":
{
"edges": 1721,
"markings": 462,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 414
},
"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": "DEADLOCK",
"processed_size": 8,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "EX(AF((1 <= p711)))",
"processed_size": 19,
"rewrites": 20
},
"net":
{
"conflict_clusters": 144,
"singleton_clusters": 0
},
"result":
{
"edges": 81,
"markings": 72,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 125,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 125,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p379) OR ((p1 + p8 + p129 + p135 + p160 + p268 + p285 + p316 + p349 + p368 + p373 + p406 + p418 + p483 + p499 + p24 + p516 + p524 + p526 + p530 + p566 + p21 + p611 + p623 + p637 + p638 + p650 + p662 + p663 + p665 + p702 + p17 + p747 + p753 + p784 + p798 + p831 + p816 + p781 + p25 + p50 <= 2) AND ((p103 + p107 + p133 + p194 + p198 + p205 + p70 + p241 + p290 + p313 + p319 + p332 + p342 + p356 + p369 + p394 + p432 + p461 + p467 + p478 + p479 + p494 + p531 + p538 + p556 + p564 + p584 + p613 + p615 + p692 + p727 + p736 + p737 + p794 + p837 + p813 + p834 + p806 + p805 + p40 + p80 <= p400) OR (1 <= p100 + p101 + p114 + p201 + p204 + p210 + p211 + p44 + p265 + p284 + p289 + p298 + p322 + p340 + p343 + p352 + p363 + p386 + p398 + p422 + p440 + p446 + p570 + p639 + p640 + p641 + p658 + p690 + p734 + p735 + p853 + p774 + p793 + p839 + p833 + p45 + p48 + p60 + p63 + p95 + p99))))))",
"processed_size": 897,
"rewrites": 20
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 552
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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": "E (G ((1 <= p688)))",
"processed_size": 19,
"rewrites": 19
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 82
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 663
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p737 <= p694)",
"processed_size": 14,
"rewrites": 22
},
"result":
{
"edges": 1813,
"markings": 513,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 828
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG((p379 + 1 <= p708)))",
"processed_size": 26,
"rewrites": 20
},
"net":
{
"conflict_clusters": 144,
"singleton_clusters": 0
},
"result":
{
"edges": 35,
"markings": 18,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1105
},
"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": "(p106 <= 0)",
"processed_size": 11,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1657
},
"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 <= p264)",
"processed_size": 11,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3315
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p393 <= p384) AND (p12 <= p95))))",
"processed_size": 41,
"rewrites": 20
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1657
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p771 + 1 <= p379) AND (1 <= p64))",
"processed_size": 35,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3315
},
"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": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 44,
"visible_transitions": 0
},
"processed": "A (((p412 + 1 <= p787) U (p94 + 1 <= p104 + p123 + p130 + p153 + p203 + p213 + p227 + p49 + p255 + p264 + p331 + p348 + p359 + p416 + p420 + p427 + p437 + p445 + p493 + p496 + p512 + p560 + p567 + p574 + p578 + p582 + p629 + p670 + p687 + p693 + p703 + p712 + p724 + p844 + p828 + p830 + p835 + p751 + p26 + p57 + p85)))",
"processed_size": 320,
"rewrites": 23
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 206
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3315
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p297 <= p668) AND (p523 <= p825))",
"processed_size": 35,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((p108 + p172 + p286 + p357 + p438 + p23 + p689 + p696 + p758 + p780 <= 0)))",
"processed_size": 81,
"rewrites": 20
},
"result":
{
"edges": 10,
"markings": 11,
"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": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p297 <= p668) AND (p523 <= p825))",
"processed_size": 35,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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": "E (G ((p365 <= 0)))",
"processed_size": 19,
"rewrites": 19
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 56
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 112272,
"runtime": 255.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A((** U **)) OR (** AND E(F(**)))) : E(G(**)) : (A(X(**)) AND (E(F(**)) AND (** AND **))) : A(F((E(X(**)) OR E(F(**))))) : A(G(**)) : ((A(F(**)) AND A(G(**))) OR (** AND E(G(**)))) : A(F(E(G(*)))) : E(F(A(G(*)))) : (E(X(A(F(**)))) OR (DEADLOCK AND (E(G(**)) AND **))) : ((** AND E(G(**))) OR (** AND A(G(**))))"
},
"net":
{
"arcs": 14789,
"conflict_clusters": 144,
"places": 854,
"places_significant": 742,
"singleton_clusters": 0,
"transitions": 2230
},
"result":
{
"preliminary_value": "no yes yes yes no yes no yes no no ",
"value": "no yes yes yes no yes no yes 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: 3084/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 27328
lola: finding significant places
lola: 854 places, 2230 transitions, 742 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: (3 <= p140)
lola: (A (((p412 + 1 <= p787) U (p94 + 1 <= p104 + p123 + p130 + p153 + p203 + p213 + p227 + p49 + p255 + p264 + p331 + p348 + p359 + p416 + p420 + p427 + p437 + p445 + p493 + p496 + p512 + p560 + p567 + p574 + p578 + p582 + p629 + p670 + p687 + p693 + p703 + p712 + p724 + p844 + p828 + p830 + p835 + p751 + p26 + p57 + p85))) OR (((p771 + 1 <= p379) AND (1 <= p64)) AND E (F ((p225 + 1 <= p297))))) : E (G ((1 <= p688))) : (((A (X (((p423 + 1 <= p6 + p128 + p193 + p303 + p404 + p508 + p545 + p648 + p644 + p235) OR (p305 + 1 <= p105 + p117 + p124 + p156 + p182 + p222 + p245 + p246 + p258 + p276 + p293 + p306 + p334 + p345 + p433 + p435 + p452 + p453 + p486 + p491 + p503 + p542 + p558 + p562 + p586 + p610 + p616 + p632 + p674 + p694 + p740 + p744 + p10 + p760 + p848 + p817 + p822 + p801 + p58 + p73 + p83)))) AND E (((0 <= 0) U (1 <= p302)))) AND (p305 <= 0)) AND ((p2 + p4 + p5 + p9 + p106 + p109 + p110 + p111 + p115 + p116 + p118 + p119 + p120 + p122 + p127 + p134 + p137 + p138 + p139 + p142 + p143 + p145 + p150 + p151 + p152 + p154 + p155 + p158 + p161 + p162 + p164 + p168 + p169 + p170 + p171 + p173 + p174 + p176 + p178 + p179 + p181 + p185 + p186 + p187 + p188 + p189 + p191 + p192 + p195 + p196 + p197 + p199 + p200 + p208 + p209 + p214 + p215 + p216 + p218 + p219 + p220 + p223 + p224 + p226 + p229 + p230 + p233 + p234 + p236 + p237 + p238 + p240 + p243 + p244 + p247 + p249 + p250 + p252 + p254 + p259 + p260 + p261 + p262 + p263 + p266 + p267 + p269 + p271 + p272 + p273 + p277 + p278 + p280 + p281 + p282 + p283 + p287 + p288 + p291 + p296 + p300 + p304 + p307 + p309 + p310 + p311 + p315 + p317 + p318 + p320 + p321 + p323 + p326 + p328 + p330 + p333 + p335 + p336 + p337 + p339 + p341 + p347 + p351 + p354 + p358 + p360 + p361 + p362 + p364 + p366 + p367 + p370 + p372 + p374 + p375 + p376 + p378 + p381 + p382 + p383 + p384 + p385 + p388 + p389 + p391 + p392 + p393 + p395 + p396 + p397 + p402 + p403 + p407 + p408 + p409 + p414 + p417 + p424 + p425 + p426 + p429 + p430 + p431 + p434 + p436 + p439 + p442 + p28 + p447 + p448 + p449 + p451 + p454 + p455 + p457 + p458 + p459 + p460 + p462 + p463 + p464 + p466 + p471 + p472 + p475 + p476 + p477 + p480 + p482 + p484 + p27 + p487 + p488 + p492 + p495 + p497 + p498 + p502 + p504 + p505 + p506 + p509 + p510 + p511 + p513 + p515 + p517 + p519 + p520 + p521 + p522 + p527 + p532 + p533 + p534 + p535 + p539 + p540 + p541 + p543 + p546 + p547 + p548 + p549 + p550 + p551 + p553 + p555 + p559 + p561 + p569 + p572 + p573 + p575 + p576 + p579 + p580 + p581 + p583 + p585 + p587 + p588 + p589 + p590 + p593 + p594 + p595 + p596 + p598 + p599 + p600 + p602 + p605 + p606 + p608 + p609 + p612 + p614 + p619 + p620 + p624 + p625 + p626 + p627 + p630 + p631 + p633 + p634 + p636 + p643 + p649 + p652 + p653 + p655 + p656 + p657 + p659 + p660 + p664 + p666 + p667 + p671 + p672 + p673 + p676 + p677 + p679 + p680 + p681 + p682 + p683 + p685 + p686 + p19 + p691 + p697 + p698 + p700 + p701 + p704 + p705 + p706 + p709 + p711 + p714 + p718 + p719 + p720 + p721 + p722 + p725 + p726 + p728 + p729 + p730 + p16 + p732 + p738 + p741 + p742 + p743 + p745 + p12 + p754 + p757 + p762 + p849 + p764 + p765 + p766 + p767 + p768 + p770 + p772 + p777 + p779 + p782 + p783 + p785 + p786 + p788 + p789 + p790 + p792 + p795 + p796 + p799 + p804 + p840 + p807 + p838 + p812 + p814 + p818 + p819 + p820 + p821 + p823 + p824 + p826 + p827 + p829 + p836 + p810 + p802 + p842 + p843 + p763 + p759 + p851 + p752 + p11 + p13 + p746 + p15 + p18 + p22 + p485 + p31 + p32 + p34 + p36 + p37 + p38 + p39 + p41 + p43 + p47 + p51 + p53 + p54 + p59 + p61 + p67 + p68 + p69 + p75 + p76 + p77 + p78 + p79 + p81 + p82 + p86 + p87 + p88 + p89 + p90 + p93 + p98 <= 2) OR (p771 <= p756))) : A (F ((E (X ((3 <= p113 + p132 + p146 + p148 + p190 + p231 + p239 + p275 + p292 + p314 + p327 + p33 + p344 + p353 + p371 + p413 + p450 + p481 + p489 + p528 + p554 + p557 + p577 + p592 + p603 + p621 + p635 + p645 + p675 + p715 + p716 + p733 + p14 + p852 + p775 + p845 + p800 + p731 + p66 + p72 + p84))) OR E (F ((2 <= p0 + p102 + p141 + p144 + p147 + p163 + p184 + p206 + p207 + p221 + p242 + p274 + p301 + p387 + p399 + p410 + p465 + p468 + p514 + p525 + p536 + p537 + p544 + p563 + p568 + p571 + p601 + p622 + p628 + p678 + p717 + p739 + p749 + p761 + p769 + p750 + p42 + p46 + p56 + p71 + p97)))))) : A (G (((2 <= p379) OR ((p1 + p8 + p129 + p135 + p160 + p268 + p285 + p316 + p349 + p368 + p373 + p406 + p418 + p483 + p499 + p24 + p516 + p524 + p526 + p530 + p566 + p21 + p611 + p623 + p637 + p638 + p650 + p662 + p663 + p665 + p702 + p17 + p747 + p753 + p784 + p798 + p831 + p816 + p781 + p25 + p50 <= 2) AND ((p103 + p107 + p133 + p194 + p198 + p205 + p70 + p241 + p290 + p313 + p319 + p332 + p342 + p356 + p369 + p394 + p432 + p461 + p467 + p478 + p479 + p494 + p531 + p538 + p556 + p564 + p584 + p613 + p615 + p692 + p727 + p736 + p737 + p794 + p837 + p813 + p834 + p806 + p805 + p40 + p80 <= p400) OR (1 <= p100 + p101 + p114 + p201 + p204 + p210 + p211 + p44 + p265 + p284 + p289 + p298 + p322 + p340 + p343 + p352 + p363 + p386 + p398 + p422 + p440 + p446 + p570 + p639 + p640 + p641 + p658 + p690 + p734 + p735 + p853 + p774 + p793 + p839 + p833 + p45 + p48 + p60 + p63 + p95 + p99)))))) : ((A (F (((1 <= p0 + p102 + p141 + p144 + p147 + p163 + p184 + p206 + p207 + p221 + p242 + p274 + p301 + p387 + p399 + p410 + p465 + p468 + p514 + p525 + p536 + p537 + p544 + p563 + p568 + p571 + p601 + p622 + p628 + p678 + p717 + p739 + p749 + p761 + p769 + p750 + p42 + p46 + p56 + p71 + p97)))) AND A (G ((p108 + p172 + p286 + p357 + p438 + p23 + p689 + p696 + p758 + p780 <= 0)))) OR (((p297 <= p668) AND (p523 <= p825)) AND E (G ((p365 <= 0))))) : NOT(E (G (A (F ((p708 <= p379)))))) : NOT(A (G (E (F ((p737 <= p694)))))) : (E (X (A (F ((1 <= p711))))) OR ((A (X ((1 <= 0))) AND E (G ((p621 <= p99)))) AND ((p397 <= 0) OR (p333 + 1 <= p833)))) : (((1 <= p264) AND E (G ((1 <= p630)))) OR ((p106 <= 0) AND A (G (((p393 <= p384) AND (p12 <= p95))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p423 + 1 <= p6 + p128 + p193 + p303 + p404 + p508 + p545 + p648 + p644 + p235) OR (p305 + 1 <= p105 + p117 + p124 + p156 + p182 + p222 + p245 + p246 + p258 + p276 + p293 + p306 + p334 + p345 + p433 + p435 + p452 + p453 + p486 + p491 + p503 + p542 + p558 + p562 + p586 + p610 + p616 + p632 + p674 + p694 + p740 + p744 + p10 + p760 + p848 + p817 + p822 + p801 + p58 + p73 + p83)))) AND (E (F ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p302)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p302)))
lola: processed formula length: 19
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p302)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p305 <= 0) AND ((p2 + p4 + p5 + p9 + p106 + p109 + p110 + p111 + p115 + p116 + p118 + p119 + p120 + p122 + p127 + p134 + p137 + p138 + p139 + p142 + p143 + p145 + p150 + p151 + p152 + p154 + p155 + p158 + p161 + p162 + p164 + p168 + p169 + p170 + p171 + p173 + p174 + p176 + p178 + p179 + p181 + p185 + p186 + p187 + p188 + p189 + p191 + p192 + p195 + p196 + p197 + p199 + p200 + p208 + p209 + p214... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p305 <= 0) AND ((p2 + p4 + p5 + p9 + p106 + p109 + p110 + p111 + p115 + p116 + p118 + p119 + p120 + p122 + p127 + p134 + p137 + p138 + p139 + p142 + p143 + p145 + p150 + p151 + p152 + p154 + p155 + p158 + p161 + p162 + p164 + p168 + p169 + p170 + p171 + p173 + p174 + p176 + p178 + p179 + p181 + p185 + p186 + p187 + p188 + p189 + p191 + p192 + p195 + p196 + p197 + p199 + p200 + p208 + p209 + p214... (shortened)
lola: processed formula length: 2863
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p423 + 1 <= p6 + p128 + p193 + p303 + p404 + p508 + p545 + p648 + p644 + p235) OR (p305 + 1 <= p105 + p117 + p124 + p156 + p182 + p222 + p245 + p246 + p258 + p276 + p293 + p306 + p334 + p345 + p433 + p435 + p452 + p453 + p486 + p491 + p503 + p542 + p558 + p562 + p586 + p610 + p616 + p632 + p674 + p694 + p740 + p744 + p10 + p760 + p848 + p817 + p822 + p801 + p58 + p73 + p83))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p423 + 1 <= p6 + p128 + p193 + p303 + p404 + p508 + p545 + p648 + p644 + p235) OR (p305 + 1 <= p105 + p117 + p124 + p156 + p182 + p222 + p245 + p246 + p258 + p276 + p293 + p306 + p334 + p345 + p433 + p435 + p452 + p453 + p486 + p491 + p503 + p542 + p558 + p562 + p586 + p610 + p616 + p632 + p674 + p694 + p740 + p744 + p10 + p760 + p848 + p817 + p822 + p801 + p58 + p73 + p83)))
lola: processed formula length: 384
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((3 <= p113 + p132 + p146 + p148 + p190 + p231 + p239 + p275 + p292 + p314 + p327 + p33 + p344 + p353 + p371 + p413 + p450 + p481 + p489 + p528 + p554 + p557 + p577 + p592 + p603 + p621 + p635 + p645 + p675 + p715 + p716 + p733 + p14 + p852 + p775 + p845 + p800 + p731 + p66 + p72 + p84))) OR E (F ((2 <= p0 + p102 + p141 + p144 + p147 + p163 + p184 + p206 + p207 + p221 + p242 + p274 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX((3 <= p113 + p132 + p146 + p148 + p190 + p231 + p239 + p275 + p292 + p314 + p327 + p33 + p344 + p353 + p371 + p413 + p450 + p481 + p489 + p528 + p554 + p557 + p577 + p592 + p603 + p621 + p635 + p645 + p675 + p715 + p716 + p733 + p14 + p852 + p775 + p845 + p800 + p731 + p66 + p72 + p84)) OR EF((2 <= p0 + p102 + p141 + p144 + p147 + p163 + p184 + p206 + p207 + p221 + p242 + p274 + p301 + p387... (shortened)
lola: processed formula length: 588
lola: 21 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 462 markings, 1721 edges
lola: ========================================
lola: subprocess 2 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F ((1 <= p711))))) OR (DEADLOCK AND (E (G ((p621 <= p99))) AND ((p397 <= 0) OR (p333 + 1 <= p833)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 3 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((1 <= p711)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((1 <= p711)))
lola: processed formula length: 19
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 72 markings, 81 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p379) OR ((p1 + p8 + p129 + p135 + p160 + p268 + p285 + p316 + p349 + p368 + p373 + p406 + p418 + p483 + p499 + p24 + p516 + p524 + p526 + p530 + p566 + p21 + p611 + p623 + p637 + p638 + p650 + p662 + p663 + p665 + p702 + p17 + p747 + p753 + p784 + p798 + p831 + p816 + p781 + p25 + p50 <= 2) AND ((p103 + p107 + p133 + p194 + p198 + p205 + p70 + p241 + p290 + p313 + p319 + p332 + p342... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= p379) OR ((p1 + p8 + p129 + p135 + p160 + p268 + p285 + p316 + p349 + p368 + p373 + p406 + p418 + p483 + p499 + p24 + p516 + p524 + p526 + p530 + p566 + p21 + p611 + p623 + p637 + p638 + p650 + p662 + p663 + p665 + p702 + p17 + p747 + p753 + p784 + p798 + p831 + p816 + p781 + p25 + p50 <= 2) AND ((p103 + p107 + p133 + p194 + p198 + p205 + p70 + p241 + p290 + p313 + p319 + p332 + p342... (shortened)
lola: processed formula length: 897
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p379 <= 1) AND ((3 <= p1 + p8 + p129 + p135 + p160 + p268 + p285 + p316 + p349 + p368 + p373 + p406 + p418 + p483 + p499 + p24 + p516 + p524 + p526 + p530 + p566 + p21 + p611 + p623 + p637 + p638 + p650 + p662 + p663 + p665 + p702 + p17 + p747 + p753 + p784 + p798 + p831 + p816 + p781 + p25 + p50) OR ((p400 + 1 <= p103 + p107 + p133 + p194 + p198 + p205 + p70 + p241 + p290 + p313 + p319 + p332 + p342 + p356 + p369 + p394 + p432 + p461 + p467 + p478 + p479 + p494 + p531 + p538 + p556 + p564 + p584 + p613 + p615 + p692 + p727 + p736 + p737 + p794 + p837 + p813 + p834 + p806 + p805 + p40 + p80) AND (p100 + p101 + p114 + p201 + p204 + p210 + p211 + p44 + p265 + p284 + p289 + p298 + p322 + p340 + p343 + p352 + p363 + p386 + p398 + p422 + p440 + p446 + p570 + p639 + p640 + p641 + p658 + p690 + p734 + p735 + p853 + p774 + p793 + p839 + p833 + p45 + p48 + p60 + p63 + p95 + p99 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 4 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p688)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p688)))
lola: processed formula length: 19
lola: 19 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: (p688 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 5 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p694 + 1 <= p737)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p737 <= p694)
lola: processed formula length: 14
lola: 22 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 513 markings, 1813 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result started, id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p737 <= p694)
lola: state equation task get result unparse finished id 1
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p694 + 1 <= p737)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p379 + 1 <= p708)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p379 + 1 <= p708)))
lola: processed formula length: 26
lola: 20 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 18 markings, 35 edges
lola: ========================================
lola: subprocess 7 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p264) AND E (G ((1 <= p630)))) OR ((p106 <= 0) AND A (G (((p393 <= p384) AND (p12 <= p95))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p106 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p106 <= 0)
lola: processed formula length: 11
lola: 18 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 8 will run for 1657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p264)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p264)
lola: processed formula length: 11
lola: 18 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 9 will run for 3315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p393 <= p384) AND (p12 <= p95))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p393 <= p384) AND (p12 <= p95))))
lola: processed formula length: 41
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p384 + 1 <= p393) OR (p95 + 1 <= p12))
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
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p412 + 1 <= p787) U (p94 + 1 <= p104 + p123 + p130 + p153 + p203 + p213 + p227 + p49 + p255 + p264 + p331 + p348 + p359 + p416 + p420 + p427 + p437 + p445 + p493 + p496 + p512 + p560 + p567 + p574 + p578 + p582 + p629 + p670 + p687 + p693 + p703 + p712 + p724 + p844 + p828 + p830 + p835 + p751 + p26 + p57 + p85))) OR (((p771 + 1 <= p379) AND (1 <= p64)) AND E (F ((p225 + 1 <= p297)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p771 + 1 <= p379) AND (1 <= p64))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p771 + 1 <= p379) AND (1 <= p64))
lola: processed formula length: 35
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p412 + 1 <= p787) U (p94 + 1 <= p104 + p123 + p130 + p153 + p203 + p213 + p227 + p49 + p255 + p264 + p331 + p348 + p359 + p416 + p420 + p427 + p437 + p445 + p493 + p496 + p512 + p560 + p567 + p574 + p578 + p582 + p629 + p670 + p687 + p693 + p703 + p712 + p724 + p844 + p828 + p830 + p835 + p751 + p26 + p57 + p85)))
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 (((p412 + 1 <= p787) U (p94 + 1 <= p104 + p123 + p130 + p153 + p203 + p213 + p227 + p49 + p255 + p264 + p331 + p348 + p359 + p416 + p420 + p427 + p437 + p445 + p493 + p496 + p512 + p560 + p567 + p574 + p578 + p582 + p629 + p670 + p687 + p693 + p703 + p712 + p724 + p844 + p828 + p830 + p835 + p751 + p26 + p57 + p85)))
lola: processed formula length: 320
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p412 + 1 <= p787)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F (((1 <= p0 + p102 + p141 + p144 + p147 + p163 + p184 + p206 + p207 + p221 + p242 + p274 + p301 + p387 + p399 + p410 + p465 + p468 + p514 + p525 + p536 + p537 + p544 + p563 + p568 + p571 + p601 + p622 + p628 + p678 + p717 + p739 + p749 + p761 + p769 + p750 + p42 + p46 + p56 + p71 + p97)))) AND A (G ((p108 + p172 + p286 + p357 + p438 + p23 + p689 + p696 + p758 + p780 <= 0)))) OR (((p297 <= p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p297 <= p668) AND (p523 <= p825))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p297 <= p668) AND (p523 <= p825))
lola: processed formula length: 35
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p108 + p172 + p286 + p357 + p438 + p23 + p689 + p696 + p758 + p780 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p108 + p172 + p286 + p357 + p438 + p23 + p689 + p696 + p758 + p780 <= 0)))
lola: processed formula length: 81
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p108 + p172 + p286 + p357 + p438 + p23 + p689 + p696 + p758 + p780)
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: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (F (((1 <= p0 + p102 + p141 + p144 + p147 + p163 + p184 + p206 + p207 + p221 + p242 + p274 + p301 + p387 + p399 + p410 + p465 + p468 + p514 + p525 + p536 + p537 + p544 + p563 + p568 + p571 + p601 + p622 + p628 + p678 + p717 + p739 + p749 + p761 + p769 + p750 + p42 + p46 + p56 + p71 + p97)))) AND A (G ((p108 + p172 + p286 + p357 + p438 + p23 + p689 + p696 + p758 + p780 <= 0)))) OR (((p297 <= p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p297 <= p668) AND (p523 <= p825))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p297 <= p668) AND (p523 <= p825))
lola: processed formula length: 35
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((p365 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p365 <= 0)))
lola: processed formula length: 19
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p365)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes no yes no no
lola:
preliminary result: no yes yes yes no yes no yes no no
lola: memory consumption: 112272 KB
lola: time consumption: 255 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="PolyORBNT-PT-S10J40"
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 PolyORBNT-PT-S10J40, 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-158987872200691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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