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.r178-tajo-158987882800763.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 DoubleExponent-PT-003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882800763
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.7K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591239131891

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:52:13] [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-04 02:52:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:52:13] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-06-04 02:52:13] [INFO ] Transformed 163 places.
[2020-06-04 02:52:13] [INFO ] Transformed 148 transitions.
[2020-06-04 02:52:13] [INFO ] Parsed PT model containing 163 places and 148 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Incomplete random walk after 100000 steps, including 3341 resets, run finished after 231 ms. (steps per millisecond=432 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 148 rows 163 cols
[2020-06-04 02:52:13] [INFO ] Computed 19 place invariants in 19 ms
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-06-04 02:52:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:14] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2020-06-04 02:52:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:14] [INFO ] Added : 133 causal constraints over 28 iterations in 373 ms. Result :sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned unsat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:14] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 31 places in 92 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 37 places in 159 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 70 places in 91 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 67 places in 53 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 52 places in 40 ms
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 65 places in 40 ms
[2020-06-04 02:52:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 543 ms
[2020-06-04 02:52:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-04 02:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:15] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-06-04 02:52:15] [INFO ] Deduced a trap composed of 31 places in 330 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 37 places in 97 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 67 places in 71 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 52 places in 50 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 65 places in 70 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 64 places in 59 ms
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 67 places in 89 ms
[2020-06-04 02:52:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 874 ms
[2020-06-04 02:52:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-06-04 02:52:16] [INFO ] Added : 127 causal constraints over 26 iterations in 392 ms. Result :sat
[2020-06-04 02:52:16] [INFO ] Deduced a trap composed of 67 places in 73 ms
[2020-06-04 02:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 13 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:17] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-04 02:52:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:17] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-04 02:52:17] [INFO ] Deduced a trap composed of 69 places in 64 ms
[2020-06-04 02:52:17] [INFO ] Deduced a trap composed of 53 places in 117 ms
[2020-06-04 02:52:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2020-06-04 02:52:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-06-04 02:52:18] [INFO ] Added : 143 causal constraints over 29 iterations in 574 ms. Result :sat
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 58 places in 83 ms
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 69 places in 68 ms
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 65 places in 58 ms
[2020-06-04 02:52:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:18] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-04 02:52:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-06-04 02:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:18] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 18 places in 55 ms
[2020-06-04 02:52:18] [INFO ] Deduced a trap composed of 42 places in 28 ms
[2020-06-04 02:52:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2020-06-04 02:52:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 12 ms.
[2020-06-04 02:52:19] [INFO ] Added : 145 causal constraints over 29 iterations in 489 ms. Result :sat
[2020-06-04 02:52:19] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:19] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-06-04 02:52:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 26 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 12 ms returned sat
[2020-06-04 02:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:19] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 43 places in 117 ms
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 42 places in 29 ms
[2020-06-04 02:52:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2020-06-04 02:52:20] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:20] [INFO ] Added : 143 causal constraints over 30 iterations in 410 ms. Result :sat
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned unsat
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:20] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2020-06-04 02:52:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:20] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-06-04 02:52:20] [INFO ] Deduced a trap composed of 18 places in 92 ms
[2020-06-04 02:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2020-06-04 02:52:20] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-06-04 02:52:21] [INFO ] Added : 145 causal constraints over 29 iterations in 359 ms. Result :sat
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-06-04 02:52:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:21] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2020-06-04 02:52:21] [INFO ] Deduced a trap composed of 31 places in 73 ms
[2020-06-04 02:52:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 149 ms
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-06-04 02:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:22] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-04 02:52:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-06-04 02:52:22] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-06-04 02:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:22] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-04 02:52:22] [INFO ] Deduced a trap composed of 18 places in 62 ms
[2020-06-04 02:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2020-06-04 02:52:22] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 20 ms.
[2020-06-04 02:52:22] [INFO ] Added : 143 causal constraints over 29 iterations in 604 ms. Result :sat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned unsat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned unsat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned unsat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:23] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 56 places in 82 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 59 places in 59 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 45 places in 66 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 47 places in 95 ms
[2020-06-04 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 337 ms
[2020-06-04 02:52:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:23] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 56 places in 48 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 59 places in 52 ms
[2020-06-04 02:52:23] [INFO ] Deduced a trap composed of 45 places in 44 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 62 places in 63 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 75 places in 64 ms
[2020-06-04 02:52:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 315 ms
[2020-06-04 02:52:24] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2020-06-04 02:52:24] [INFO ] Added : 143 causal constraints over 29 iterations in 320 ms. Result :sat
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 56 places in 68 ms
[2020-06-04 02:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2020-06-04 02:52:24] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2020-06-04 02:52:24] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:52:24] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-06-04 02:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:24] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2020-06-04 02:52:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:52:24] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-06-04 02:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:24] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 68 places in 62 ms
[2020-06-04 02:52:24] [INFO ] Deduced a trap composed of 56 places in 72 ms
[2020-06-04 02:52:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2020-06-04 02:52:24] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-06-04 02:52:25] [INFO ] Added : 145 causal constraints over 30 iterations in 292 ms. Result :sat
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 40 places in 57 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 43 places in 49 ms
[2020-06-04 02:52:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2020-06-04 02:52:25] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-06-04 02:52:25] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:52:25] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 12 ms returned sat
[2020-06-04 02:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:25] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-04 02:52:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:52:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:52:25] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-06-04 02:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:52:25] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 42 places in 68 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 71 places in 56 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 69 places in 72 ms
[2020-06-04 02:52:25] [INFO ] Deduced a trap composed of 53 places in 72 ms
[2020-06-04 02:52:26] [INFO ] Deduced a trap composed of 48 places in 53 ms
[2020-06-04 02:52:26] [INFO ] Deduced a trap composed of 68 places in 55 ms
[2020-06-04 02:52:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 415 ms
[2020-06-04 02:52:26] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-06-04 02:52:26] [INFO ] Added : 143 causal constraints over 29 iterations in 323 ms. Result :sat
[2020-06-04 02:52:26] [INFO ] Deduced a trap composed of 37 places in 45 ms
[2020-06-04 02:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2020-06-04 02:52:26] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned unsat
Successfully simplified 18 atomic propositions for a total of 18 simplifications.
[2020-06-04 02:52:26] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-04 02:52:26] [INFO ] Flatten gal took : 60 ms
[2020-06-04 02:52:26] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-04 02:52:26] [INFO ] Flatten gal took : 24 ms
FORMULA DoubleExponent-PT-003-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:52:26] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 02:52:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DoubleExponent-PT-003 @ 3570 seconds

FORMULA DoubleExponent-PT-003-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DoubleExponent-PT-003-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for CTLCardinality @ DoubleExponent-PT-003

{
"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": "Thu Jun 4 02:52:27 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p142 + 1 <= p17))",
"processed_size": 19,
"rewrites": 26
},
"result":
{
"edges": 2689,
"markings": 2690,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG((AX((p15 <= p52)) AND NOT DEADLOCK))",
"processed_size": 39,
"rewrites": 25
},
"net":
{
"conflict_clusters": 109,
"singleton_clusters": 0
},
"result":
{
"edges": 3711,
"markings": 3712,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p110 + 1 <= p141) OR (p90 <= 0))",
"processed_size": 35,
"rewrites": 26
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G ((((p145 <= 0) OR (p11 + 1 <= p23)))))",
"processed_size": 44,
"rewrites": 24
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (G (((p48 <= p99) OR ((p74 + 1 <= p145) AND (p70 <= 2)))))",
"processed_size": 61,
"rewrites": 24
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p93 <= p76))",
"processed_size": 14,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"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": "G (((p36 <= p127) U (p161 <= p120)))",
"processed_size": 36,
"rewrites": 25
},
"result":
{
"edges": 2649747,
"markings": 2395576,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

{
"child":
[

{
"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": "(p22 <= 0)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p93 <= p76))",
"processed_size": 14,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p16 <= p2)))",
"processed_size": 19,
"rewrites": 25
},
"result":
{
"edges": 3408,
"markings": 3409,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22088,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : E(G(*)) : A(G(A((** U **)))) : E(G(**)) : A(F(**)) : E(G((A(X(**)) AND NODEADLOCK))) : A(X(A(G(**)))) : TRUE : (** AND (A(G(**)) AND **))"
},
"net":
{
"arcs": 417,
"conflict_clusters": 109,
"places": 163,
"places_significant": 144,
"singleton_clusters": 0,
"transitions": 148
},
"result":
{
"preliminary_value": "yes yes yes yes no no no yes no ",
"value": "yes yes yes yes no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 311/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5216
lola: finding significant places
lola: 163 places, 148 transitions, 144 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p104)
lola: LP says that atomic proposition is always true: (p26 <= p70)
lola: LP says that atomic proposition is always false: (3 <= p145)
lola: LP says that atomic proposition is always false: (3 <= p19)
lola: (NOT(A (F ((p60 + 1 <= p1)))) OR E (G ((0 <= 0)))) : NOT(A (F ((((1 <= p145) AND (p23 <= p11)))))) : A (G (A (((p36 <= p127) U (p161 <= p120))))) : E (G (((p48 <= p99) OR ((p74 + 1 <= p145) AND (p70 <= 2))))) : A (((0 <= 0) U ((p141 <= p110) AND (1 <= p90)))) : E (G ((A (X ((p15 <= p52))) AND E (X ((0 <= 0)))))) : A (G (A (X (((p17 <= p142)))))) : E (G ((0 <= 0))) : (A ((((p94 <= p40)) U (1 <= 0))) OR (((p22 <= 0) AND A (G ((p16 <= p2)))) AND ((p93 <= p76))))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:123
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p17 <= p142))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p142 + 1 <= p17))
lola: processed formula length: 19
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: ((p142 + 1 <= p17))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 2690 markings, 2689 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((p15 <= p52))) AND NOT DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AX((p15 <= p52)) AND NOT DEADLOCK))
lola: processed formula length: 39
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3712 markings, 3711 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p141 <= p110) AND (1 <= p90))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p110 + 1 <= p141) OR (p90 <= 0))
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p141 <= p110) AND (1 <= p90))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p145 <= 0) OR (p11 + 1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p145 <= 0) OR (p11 + 1 <= p23)))))
lola: processed formula length: 44
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p145) AND (p23 <= p11)))
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p48 <= p99) OR ((p74 + 1 <= p145) AND (p70 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p48 <= p99) OR ((p74 + 1 <= p145) AND (p70 <= 2)))))
lola: processed formula length: 61
lola: 24 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: ((p99 + 1 <= p48) AND ((p145 <= p74) OR (3 <= p70)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p22 <= 0) AND (A (G ((p16 <= p2))) AND ((p93 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p22 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= 0)
lola: processed formula length: 10
lola: 23 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 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p93 <= p76))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p93 <= p76))
lola: processed formula length: 14
lola: 23 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p36 <= p127) U (p161 <= p120)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p36 <= p127) U (p161 <= p120)))
lola: processed formula length: 36
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2194717 markings, 2426892 edges, 438943 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The universal single path CTL formula holds.
lola: 2395576 markings, 2649747 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p22 <= 0) AND (A (G ((p16 <= p2))) AND ((p93 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p22 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= 0)
lola: processed formula length: 10
lola: 23 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: ========================================
lola: ...considering subproblem: ((p93 <= p76))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p93 <= p76))
lola: processed formula length: 14
lola: 23 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: ========================================
lola: ...considering subproblem: A (G ((p16 <= p2)))
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 ((p16 <= p2)))
lola: processed formula length: 19
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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: (p2 + 1 <= p16)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3409 markings, 3408 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no yes no
lola:
preliminary result: yes yes yes yes no no no yes no
lola: memory consumption: 22088 KB
lola: time consumption: 9 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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r178-tajo-158987882800763"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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