Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000177.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is BusinessProcesses-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K May 5 16:51 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 BusinessProcesses-PT-05-00
FORMULA_NAME BusinessProcesses-PT-05-01
FORMULA_NAME BusinessProcesses-PT-05-02
FORMULA_NAME BusinessProcesses-PT-05-03
FORMULA_NAME BusinessProcesses-PT-05-04
FORMULA_NAME BusinessProcesses-PT-05-05
FORMULA_NAME BusinessProcesses-PT-05-06
FORMULA_NAME BusinessProcesses-PT-05-07
FORMULA_NAME BusinessProcesses-PT-05-08
FORMULA_NAME BusinessProcesses-PT-05-09
FORMULA_NAME BusinessProcesses-PT-05-10
FORMULA_NAME BusinessProcesses-PT-05-11
FORMULA_NAME BusinessProcesses-PT-05-12
FORMULA_NAME BusinessProcesses-PT-05-13
FORMULA_NAME BusinessProcesses-PT-05-14
FORMULA_NAME BusinessProcesses-PT-05-15

=== Now, execution of the tool begins

BK_START 1620936211861

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:03:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:03:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:03:34] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2021-05-13 20:03:34] [INFO ] Transformed 368 places.
[2021-05-13 20:03:34] [INFO ] Transformed 319 transitions.
[2021-05-13 20:03:34] [INFO ] Found NUPN structural information;
[2021-05-13 20:03:34] [INFO ] Parsed PT model containing 368 places and 319 transitions in 161 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 87 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 940 resets, run finished after 325 ms. (steps per millisecond=307 ) properties seen :[1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2021-05-13 20:03:34] [INFO ] Computed 57 place invariants in 38 ms
[2021-05-13 20:03:35] [INFO ] [Real]Absence check using 41 positive place invariants in 73 ms returned sat
[2021-05-13 20:03:35] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 17 ms returned sat
[2021-05-13 20:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:03:35] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2021-05-13 20:03:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:03:35] [INFO ] [Nat]Absence check using 41 positive place invariants in 54 ms returned sat
[2021-05-13 20:03:35] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 10 ms returned sat
[2021-05-13 20:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:03:36] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2021-05-13 20:03:36] [INFO ] Deduced a trap composed of 11 places in 165 ms
[2021-05-13 20:03:36] [INFO ] Deduced a trap composed of 10 places in 131 ms
[2021-05-13 20:03:36] [INFO ] Deduced a trap composed of 8 places in 99 ms
[2021-05-13 20:03:36] [INFO ] Deduced a trap composed of 18 places in 176 ms
[2021-05-13 20:03:37] [INFO ] Deduced a trap composed of 14 places in 344 ms
[2021-05-13 20:03:37] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2021-05-13 20:03:38] [INFO ] Deduced a trap composed of 15 places in 624 ms
[2021-05-13 20:03:38] [INFO ] Deduced a trap composed of 33 places in 115 ms
[2021-05-13 20:03:38] [INFO ] Deduced a trap composed of 46 places in 73 ms
[2021-05-13 20:03:38] [INFO ] Deduced a trap composed of 22 places in 63 ms
[2021-05-13 20:03:38] [INFO ] Deduced a trap composed of 42 places in 108 ms
[2021-05-13 20:03:38] [INFO ] Deduced a trap composed of 18 places in 98 ms
[2021-05-13 20:03:38] [INFO ] Deduced a trap composed of 42 places in 94 ms
[2021-05-13 20:03:40] [INFO ] Deduced a trap composed of 45 places in 1928 ms
[2021-05-13 20:03:41] [INFO ] Deduced a trap composed of 15 places in 987 ms
[2021-05-13 20:03:41] [INFO ] Deduced a trap composed of 29 places in 104 ms
[2021-05-13 20:03:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5582 ms
[2021-05-13 20:03:41] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 33 ms.
[2021-05-13 20:03:43] [INFO ] Added : 172 causal constraints over 35 iterations in 1171 ms. Result :sat
[2021-05-13 20:03:43] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned sat
[2021-05-13 20:03:43] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-13 20:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:03:43] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2021-05-13 20:03:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:03:43] [INFO ] [Nat]Absence check using 41 positive place invariants in 30 ms returned sat
[2021-05-13 20:03:43] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:03:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:03:43] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2021-05-13 20:03:44] [INFO ] Deduced a trap composed of 11 places in 88 ms
[2021-05-13 20:03:44] [INFO ] Deduced a trap composed of 9 places in 125 ms
[2021-05-13 20:03:44] [INFO ] Deduced a trap composed of 18 places in 250 ms
[2021-05-13 20:03:44] [INFO ] Deduced a trap composed of 20 places in 264 ms
[2021-05-13 20:03:44] [INFO ] Deduced a trap composed of 35 places in 156 ms
[2021-05-13 20:03:45] [INFO ] Deduced a trap composed of 20 places in 894 ms
[2021-05-13 20:03:45] [INFO ] Deduced a trap composed of 19 places in 120 ms
[2021-05-13 20:03:46] [INFO ] Deduced a trap composed of 12 places in 212 ms
[2021-05-13 20:03:46] [INFO ] Deduced a trap composed of 19 places in 103 ms
[2021-05-13 20:03:46] [INFO ] Deduced a trap composed of 24 places in 104 ms
[2021-05-13 20:03:46] [INFO ] Deduced a trap composed of 91 places in 97 ms
[2021-05-13 20:03:46] [INFO ] Deduced a trap composed of 22 places in 97 ms
[2021-05-13 20:03:46] [INFO ] Deduced a trap composed of 89 places in 171 ms
[2021-05-13 20:03:47] [INFO ] Deduced a trap composed of 40 places in 160 ms
[2021-05-13 20:03:47] [INFO ] Deduced a trap composed of 38 places in 161 ms
[2021-05-13 20:03:47] [INFO ] Deduced a trap composed of 91 places in 182 ms
[2021-05-13 20:03:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3467 ms
[2021-05-13 20:03:47] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 16 ms.
[2021-05-13 20:03:48] [INFO ] Added : 240 causal constraints over 49 iterations in 1270 ms. Result :sat
[2021-05-13 20:03:48] [INFO ] Deduced a trap composed of 94 places in 120 ms
[2021-05-13 20:03:48] [INFO ] Deduced a trap composed of 96 places in 107 ms
[2021-05-13 20:03:49] [INFO ] Deduced a trap composed of 95 places in 110 ms
[2021-05-13 20:03:49] [INFO ] Deduced a trap composed of 92 places in 309 ms
[2021-05-13 20:03:49] [INFO ] Deduced a trap composed of 97 places in 105 ms
[2021-05-13 20:03:49] [INFO ] Deduced a trap composed of 99 places in 125 ms
[2021-05-13 20:03:49] [INFO ] Deduced a trap composed of 93 places in 143 ms
[2021-05-13 20:03:50] [INFO ] Deduced a trap composed of 19 places in 124 ms
[2021-05-13 20:03:50] [INFO ] Deduced a trap composed of 90 places in 138 ms
[2021-05-13 20:03:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1648 ms
[2021-05-13 20:03:50] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2021-05-13 20:03:50] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2021-05-13 20:03:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:03:50] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2021-05-13 20:03:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:03:50] [INFO ] [Nat]Absence check using 41 positive place invariants in 85 ms returned sat
[2021-05-13 20:03:50] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-13 20:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:03:51] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2021-05-13 20:03:51] [INFO ] Deduced a trap composed of 13 places in 134 ms
[2021-05-13 20:03:51] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2021-05-13 20:03:51] [INFO ] Deduced a trap composed of 24 places in 96 ms
[2021-05-13 20:03:51] [INFO ] Deduced a trap composed of 24 places in 142 ms
[2021-05-13 20:03:51] [INFO ] Deduced a trap composed of 89 places in 115 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 26 places in 112 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 89 places in 99 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 95 places in 128 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 19 places in 94 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 35 places in 92 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 18 places in 95 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 95 places in 94 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 97 places in 136 ms
[2021-05-13 20:03:52] [INFO ] Deduced a trap composed of 38 places in 77 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 97 places in 143 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 96 places in 98 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 95 places in 69 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 19 places in 71 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 96 places in 123 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 96 places in 97 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 95 places in 117 ms
[2021-05-13 20:03:53] [INFO ] Deduced a trap composed of 93 places in 72 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 95 places in 102 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 93 places in 67 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 17 places in 103 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 99 places in 71 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 31 places in 119 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 94 places in 107 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 48 places in 98 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 95 places in 93 ms
[2021-05-13 20:03:54] [INFO ] Deduced a trap composed of 45 places in 109 ms
[2021-05-13 20:03:55] [INFO ] Deduced a trap composed of 99 places in 137 ms
[2021-05-13 20:03:55] [INFO ] Deduced a trap composed of 97 places in 116 ms
[2021-05-13 20:03:55] [INFO ] Deduced a trap composed of 35 places in 103 ms
[2021-05-13 20:03:55] [INFO ] Deduced a trap composed of 97 places in 200 ms
[2021-05-13 20:03:55] [INFO ] Deduced a trap composed of 98 places in 120 ms
[2021-05-13 20:03:55] [INFO ] Deduced a trap composed of 94 places in 122 ms
[2021-05-13 20:03:55] [INFO ] Deduced a trap composed of 30 places in 116 ms
[2021-05-13 20:03:56] [INFO ] Deduced a trap composed of 48 places in 107 ms
[2021-05-13 20:03:56] [INFO ] Deduced a trap composed of 30 places in 111 ms
[2021-05-13 20:03:56] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2021-05-13 20:03:56] [INFO ] Deduced a trap composed of 92 places in 161 ms
[2021-05-13 20:03:56] [INFO ] Deduced a trap composed of 90 places in 135 ms
[2021-05-13 20:03:56] [INFO ] Deduced a trap composed of 88 places in 106 ms
[2021-05-13 20:03:57] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2021-05-13 20:03:57] [INFO ] Deduced a trap composed of 89 places in 122 ms
[2021-05-13 20:03:57] [INFO ] Deduced a trap composed of 91 places in 104 ms
[2021-05-13 20:03:57] [INFO ] Deduced a trap composed of 20 places in 144 ms
[2021-05-13 20:03:57] [INFO ] Deduced a trap composed of 90 places in 106 ms
[2021-05-13 20:03:57] [INFO ] Deduced a trap composed of 91 places in 104 ms
[2021-05-13 20:03:57] [INFO ] Deduced a trap composed of 97 places in 164 ms
[2021-05-13 20:03:58] [INFO ] Deduced a trap composed of 95 places in 138 ms
[2021-05-13 20:03:58] [INFO ] Deduced a trap composed of 95 places in 156 ms
[2021-05-13 20:03:58] [INFO ] Deduced a trap composed of 99 places in 133 ms
[2021-05-13 20:03:58] [INFO ] Deduced a trap composed of 95 places in 230 ms
[2021-05-13 20:03:58] [INFO ] Deduced a trap composed of 94 places in 164 ms
[2021-05-13 20:03:58] [INFO ] Deduced a trap composed of 95 places in 126 ms
[2021-05-13 20:03:59] [INFO ] Deduced a trap composed of 97 places in 154 ms
[2021-05-13 20:03:59] [INFO ] Deduced a trap composed of 94 places in 133 ms
[2021-05-13 20:03:59] [INFO ] Deduced a trap composed of 92 places in 101 ms
[2021-05-13 20:03:59] [INFO ] Deduced a trap composed of 43 places in 110 ms
[2021-05-13 20:03:59] [INFO ] Deduced a trap composed of 92 places in 152 ms
[2021-05-13 20:03:59] [INFO ] Deduced a trap composed of 90 places in 155 ms
[2021-05-13 20:03:59] [INFO ] Deduced a trap composed of 93 places in 151 ms
[2021-05-13 20:04:00] [INFO ] Deduced a trap composed of 91 places in 133 ms
[2021-05-13 20:04:00] [INFO ] Deduced a trap composed of 88 places in 182 ms
[2021-05-13 20:04:00] [INFO ] Deduced a trap composed of 90 places in 163 ms
[2021-05-13 20:04:00] [INFO ] Deduced a trap composed of 92 places in 102 ms
[2021-05-13 20:04:00] [INFO ] Deduced a trap composed of 90 places in 103 ms
[2021-05-13 20:04:00] [INFO ] Deduced a trap composed of 92 places in 116 ms
[2021-05-13 20:04:01] [INFO ] Deduced a trap composed of 89 places in 110 ms
[2021-05-13 20:04:01] [INFO ] Deduced a trap composed of 90 places in 103 ms
[2021-05-13 20:04:01] [INFO ] Deduced a trap composed of 89 places in 106 ms
[2021-05-13 20:04:01] [INFO ] Deduced a trap composed of 93 places in 99 ms
[2021-05-13 20:04:01] [INFO ] Deduced a trap composed of 47 places in 158 ms
[2021-05-13 20:04:01] [INFO ] Deduced a trap composed of 58 places in 126 ms
[2021-05-13 20:04:01] [INFO ] Deduced a trap composed of 26 places in 110 ms
[2021-05-13 20:04:02] [INFO ] Deduced a trap composed of 94 places in 104 ms
[2021-05-13 20:04:02] [INFO ] Deduced a trap composed of 96 places in 102 ms
[2021-05-13 20:04:02] [INFO ] Deduced a trap composed of 85 places in 112 ms
[2021-05-13 20:04:02] [INFO ] Deduced a trap composed of 91 places in 124 ms
[2021-05-13 20:04:02] [INFO ] Deduced a trap composed of 91 places in 110 ms
[2021-05-13 20:04:02] [INFO ] Deduced a trap composed of 92 places in 103 ms
[2021-05-13 20:04:02] [INFO ] Deduced a trap composed of 87 places in 153 ms
[2021-05-13 20:04:03] [INFO ] Deduced a trap composed of 91 places in 117 ms
[2021-05-13 20:04:03] [INFO ] Deduced a trap composed of 88 places in 116 ms
[2021-05-13 20:04:03] [INFO ] Deduced a trap composed of 89 places in 107 ms
[2021-05-13 20:04:03] [INFO ] Deduced a trap composed of 93 places in 122 ms
[2021-05-13 20:04:03] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 12252 ms
[2021-05-13 20:04:03] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 28 ms.
[2021-05-13 20:04:04] [INFO ] Added : 237 causal constraints over 48 iterations in 1360 ms. Result :sat
[2021-05-13 20:04:05] [INFO ] [Real]Absence check using 41 positive place invariants in 47 ms returned sat
[2021-05-13 20:04:05] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2021-05-13 20:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:05] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2021-05-13 20:04:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:05] [INFO ] [Nat]Absence check using 41 positive place invariants in 108 ms returned unsat
[2021-05-13 20:04:05] [INFO ] [Real]Absence check using 41 positive place invariants in 8 ms returned unsat
[2021-05-13 20:04:05] [INFO ] [Real]Absence check using 41 positive place invariants in 29 ms returned sat
[2021-05-13 20:04:05] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 20:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:06] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-13 20:04:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned unsat
[2021-05-13 20:04:06] [INFO ] [Real]Absence check using 41 positive place invariants in 27 ms returned sat
[2021-05-13 20:04:06] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 20:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:06] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-13 20:04:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 55 ms returned sat
[2021-05-13 20:04:06] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-13 20:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:07] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2021-05-13 20:04:07] [INFO ] Deduced a trap composed of 86 places in 107 ms
[2021-05-13 20:04:07] [INFO ] Deduced a trap composed of 13 places in 150 ms
[2021-05-13 20:04:07] [INFO ] Deduced a trap composed of 9 places in 127 ms
[2021-05-13 20:04:07] [INFO ] Deduced a trap composed of 18 places in 119 ms
[2021-05-13 20:04:07] [INFO ] Deduced a trap composed of 18 places in 116 ms
[2021-05-13 20:04:07] [INFO ] Deduced a trap composed of 8 places in 106 ms
[2021-05-13 20:04:08] [INFO ] Deduced a trap composed of 15 places in 145 ms
[2021-05-13 20:04:08] [INFO ] Deduced a trap composed of 19 places in 121 ms
[2021-05-13 20:04:08] [INFO ] Deduced a trap composed of 17 places in 90 ms
[2021-05-13 20:04:08] [INFO ] Deduced a trap composed of 21 places in 145 ms
[2021-05-13 20:04:08] [INFO ] Deduced a trap composed of 92 places in 113 ms
[2021-05-13 20:04:08] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2021-05-13 20:04:08] [INFO ] Deduced a trap composed of 20 places in 108 ms
[2021-05-13 20:04:08] [INFO ] Deduced a trap composed of 36 places in 109 ms
[2021-05-13 20:04:09] [INFO ] Deduced a trap composed of 90 places in 103 ms
[2021-05-13 20:04:09] [INFO ] Deduced a trap composed of 96 places in 82 ms
[2021-05-13 20:04:09] [INFO ] Deduced a trap composed of 94 places in 133 ms
[2021-05-13 20:04:09] [INFO ] Deduced a trap composed of 41 places in 152 ms
[2021-05-13 20:04:09] [INFO ] Deduced a trap composed of 32 places in 102 ms
[2021-05-13 20:04:09] [INFO ] Deduced a trap composed of 96 places in 104 ms
[2021-05-13 20:04:09] [INFO ] Deduced a trap composed of 18 places in 103 ms
[2021-05-13 20:04:09] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 21 places in 113 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 22 places in 99 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 19 places in 98 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 35 places in 97 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 39 places in 103 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 33 places in 101 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 91 places in 74 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 94 places in 156 ms
[2021-05-13 20:04:10] [INFO ] Deduced a trap composed of 91 places in 108 ms
[2021-05-13 20:04:11] [INFO ] Deduced a trap composed of 97 places in 111 ms
[2021-05-13 20:04:11] [INFO ] Deduced a trap composed of 91 places in 112 ms
[2021-05-13 20:04:11] [INFO ] Deduced a trap composed of 95 places in 112 ms
[2021-05-13 20:04:11] [INFO ] Deduced a trap composed of 91 places in 106 ms
[2021-05-13 20:04:11] [INFO ] Deduced a trap composed of 97 places in 89 ms
[2021-05-13 20:04:11] [INFO ] Deduced a trap composed of 38 places in 127 ms
[2021-05-13 20:04:11] [INFO ] Deduced a trap composed of 95 places in 98 ms
[2021-05-13 20:04:11] [INFO ] Deduced a trap composed of 95 places in 101 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 96 places in 100 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 95 places in 99 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 92 places in 99 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 94 places in 105 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 93 places in 90 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 95 places in 87 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 91 places in 95 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 92 places in 122 ms
[2021-05-13 20:04:12] [INFO ] Deduced a trap composed of 87 places in 80 ms
[2021-05-13 20:04:13] [INFO ] Deduced a trap composed of 93 places in 105 ms
[2021-05-13 20:04:13] [INFO ] Deduced a trap composed of 95 places in 79 ms
[2021-05-13 20:04:13] [INFO ] Deduced a trap composed of 92 places in 120 ms
[2021-05-13 20:04:13] [INFO ] Deduced a trap composed of 88 places in 106 ms
[2021-05-13 20:04:13] [INFO ] Deduced a trap composed of 93 places in 107 ms
[2021-05-13 20:04:13] [INFO ] Deduced a trap composed of 91 places in 104 ms
[2021-05-13 20:04:13] [INFO ] Deduced a trap composed of 92 places in 104 ms
[2021-05-13 20:04:13] [INFO ] Deduced a trap composed of 91 places in 145 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 93 places in 108 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 93 places in 121 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 86 places in 103 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 37 places in 72 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 97 places in 70 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 99 places in 72 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 87 places in 72 ms
[2021-05-13 20:04:14] [INFO ] Deduced a trap composed of 91 places in 124 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 26 places in 106 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 97 places in 101 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 101 places in 84 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 102 places in 71 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 102 places in 69 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 92 places in 75 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 96 places in 124 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 96 places in 103 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 88 places in 80 ms
[2021-05-13 20:04:15] [INFO ] Deduced a trap composed of 93 places in 70 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 95 places in 75 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 93 places in 75 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 87 places in 128 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 91 places in 96 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 88 places in 103 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 93 places in 101 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 92 places in 119 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 97 places in 101 ms
[2021-05-13 20:04:16] [INFO ] Deduced a trap composed of 17 places in 68 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 90 places in 94 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 91 places in 124 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 87 places in 101 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 88 places in 74 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 92 places in 89 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 89 places in 94 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 97 places in 67 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 88 places in 83 ms
[2021-05-13 20:04:17] [INFO ] Deduced a trap composed of 87 places in 98 ms
[2021-05-13 20:04:18] [INFO ] Deduced a trap composed of 94 places in 94 ms
[2021-05-13 20:04:18] [INFO ] Deduced a trap composed of 97 places in 136 ms
[2021-05-13 20:04:18] [INFO ] Deduced a trap composed of 93 places in 97 ms
[2021-05-13 20:04:18] [INFO ] Deduced a trap composed of 98 places in 89 ms
[2021-05-13 20:04:18] [INFO ] Deduced a trap composed of 87 places in 93 ms
[2021-05-13 20:04:18] [INFO ] Deduced a trap composed of 97 places in 81 ms
[2021-05-13 20:04:18] [INFO ] Trap strengthening (SAT) tested/added 101/100 trap constraints in 11570 ms
[2021-05-13 20:04:18] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 17 ms.
[2021-05-13 20:04:19] [INFO ] Added : 188 causal constraints over 39 iterations in 1174 ms. Result :sat
[2021-05-13 20:04:20] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2021-05-13 20:04:20] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 22 ms returned sat
[2021-05-13 20:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:20] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-13 20:04:20] [INFO ] Deduced a trap composed of 8 places in 117 ms
[2021-05-13 20:04:20] [INFO ] Deduced a trap composed of 22 places in 86 ms
[2021-05-13 20:04:20] [INFO ] Deduced a trap composed of 41 places in 127 ms
[2021-05-13 20:04:20] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2021-05-13 20:04:20] [INFO ] Deduced a trap composed of 45 places in 66 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 23 places in 64 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 19 places in 64 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 15 places in 77 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 32 places in 77 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 33 places in 57 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 34 places in 70 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 47 places in 71 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 45 places in 68 ms
[2021-05-13 20:04:21] [INFO ] Deduced a trap composed of 41 places in 58 ms
[2021-05-13 20:04:21] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1289 ms
[2021-05-13 20:04:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 55 ms returned sat
[2021-05-13 20:04:21] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:22] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2021-05-13 20:04:22] [INFO ] Deduced a trap composed of 8 places in 99 ms
[2021-05-13 20:04:22] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2021-05-13 20:04:22] [INFO ] Deduced a trap composed of 41 places in 105 ms
[2021-05-13 20:04:22] [INFO ] Deduced a trap composed of 45 places in 79 ms
[2021-05-13 20:04:22] [INFO ] Deduced a trap composed of 23 places in 71 ms
[2021-05-13 20:04:22] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2021-05-13 20:04:22] [INFO ] Deduced a trap composed of 26 places in 107 ms
[2021-05-13 20:04:22] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2021-05-13 20:04:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 810 ms
[2021-05-13 20:04:23] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 15 ms.
[2021-05-13 20:04:23] [INFO ] Added : 151 causal constraints over 31 iterations in 612 ms. Result :sat
[2021-05-13 20:04:23] [INFO ] [Real]Absence check using 41 positive place invariants in 38 ms returned sat
[2021-05-13 20:04:23] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2021-05-13 20:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:24] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2021-05-13 20:04:24] [INFO ] Deduced a trap composed of 10 places in 144 ms
[2021-05-13 20:04:24] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2021-05-13 20:04:24] [INFO ] Deduced a trap composed of 16 places in 103 ms
[2021-05-13 20:04:24] [INFO ] Deduced a trap composed of 94 places in 116 ms
[2021-05-13 20:04:24] [INFO ] Deduced a trap composed of 32 places in 97 ms
[2021-05-13 20:04:24] [INFO ] Deduced a trap composed of 12 places in 118 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 37 places in 114 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 19 places in 102 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 89 places in 95 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 23 places in 75 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 40 places in 111 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 27 places in 88 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 42 places in 86 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2021-05-13 20:04:25] [INFO ] Deduced a trap composed of 47 places in 73 ms
[2021-05-13 20:04:26] [INFO ] Deduced a trap composed of 21 places in 83 ms
[2021-05-13 20:04:26] [INFO ] Deduced a trap composed of 89 places in 85 ms
[2021-05-13 20:04:26] [INFO ] Deduced a trap composed of 16 places in 86 ms
[2021-05-13 20:04:26] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2021-05-13 20:04:26] [INFO ] Deduced a trap composed of 17 places in 39 ms
[2021-05-13 20:04:26] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2306 ms
[2021-05-13 20:04:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:26] [INFO ] [Nat]Absence check using 41 positive place invariants in 57 ms returned sat
[2021-05-13 20:04:26] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:26] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2021-05-13 20:04:26] [INFO ] Deduced a trap composed of 8 places in 115 ms
[2021-05-13 20:04:27] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2021-05-13 20:04:27] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2021-05-13 20:04:27] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2021-05-13 20:04:27] [INFO ] Deduced a trap composed of 18 places in 70 ms
[2021-05-13 20:04:27] [INFO ] Deduced a trap composed of 36 places in 66 ms
[2021-05-13 20:04:27] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2021-05-13 20:04:27] [INFO ] Deduced a trap composed of 28 places in 65 ms
[2021-05-13 20:04:27] [INFO ] Deduced a trap composed of 51 places in 99 ms
[2021-05-13 20:04:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 942 ms
[2021-05-13 20:04:27] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 20 ms.
[2021-05-13 20:04:28] [INFO ] Added : 194 causal constraints over 40 iterations in 809 ms. Result :sat
[2021-05-13 20:04:28] [INFO ] [Real]Absence check using 41 positive place invariants in 52 ms returned sat
[2021-05-13 20:04:28] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2021-05-13 20:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:29] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2021-05-13 20:04:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned unsat
[2021-05-13 20:04:29] [INFO ] [Real]Absence check using 41 positive place invariants in 28 ms returned sat
[2021-05-13 20:04:29] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 20:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:29] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-13 20:04:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 31 ms returned unsat
[2021-05-13 20:04:29] [INFO ] [Real]Absence check using 41 positive place invariants in 43 ms returned sat
[2021-05-13 20:04:29] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2021-05-13 20:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:32] [INFO ] [Real]Absence check using state equation in 2363 ms returned sat
[2021-05-13 20:04:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 24 ms returned unsat
[2021-05-13 20:04:32] [INFO ] [Real]Absence check using 41 positive place invariants in 22 ms returned sat
[2021-05-13 20:04:32] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-13 20:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:32] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2021-05-13 20:04:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:04:33] [INFO ] [Nat]Absence check using 41 positive place invariants in 79 ms returned sat
[2021-05-13 20:04:33] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 20:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:04:33] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2021-05-13 20:04:33] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2021-05-13 20:04:34] [INFO ] Deduced a trap composed of 12 places in 578 ms
[2021-05-13 20:04:37] [INFO ] Deduced a trap composed of 8 places in 2847 ms
[2021-05-13 20:04:37] [INFO ] Deduced a trap composed of 20 places in 142 ms
[2021-05-13 20:04:37] [INFO ] Deduced a trap composed of 15 places in 106 ms
[2021-05-13 20:04:37] [INFO ] Deduced a trap composed of 92 places in 142 ms
[2021-05-13 20:04:37] [INFO ] Deduced a trap composed of 16 places in 289 ms
[2021-05-13 20:04:38] [INFO ] Deduced a trap composed of 18 places in 112 ms
[2021-05-13 20:04:39] [INFO ] Deduced a trap composed of 15 places in 1005 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 18 places in 1143 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 22 places in 59 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 23 places in 54 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 37 places in 57 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 33 places in 48 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 29 places in 47 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 42 places in 57 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 26 places in 61 ms
[2021-05-13 20:04:40] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2021-05-13 20:04:40] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7219 ms
[2021-05-13 20:04:40] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 20 ms.
[2021-05-13 20:04:41] [INFO ] Added : 194 causal constraints over 39 iterations in 875 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-05-13 20:04:41] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 20:04:41] [INFO ] Flatten gal took : 102 ms
FORMULA BusinessProcesses-PT-05-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:04:41] [INFO ] Applying decomposition
[2021-05-13 20:04:41] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 20:04:41] [INFO ] Flatten gal took : 26 ms
[2021-05-13 20:04:42] [INFO ] Decomposing Gal with order
[2021-05-13 20:04:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 20:04:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 20:04:42] [INFO ] Flatten gal took : 110 ms
[2021-05-13 20:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-13 20:04:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BusinessProcesses-PT-05-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:04:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-13 20:04:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-05 @ 3570 seconds

FORMULA BusinessProcesses-PT-05-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ BusinessProcesses-PT-05

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 20:04:42 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (((((1 <= p279)) AND ((p359 <= 0))) R ((((1 <= p5)) AND ((p136 <= 0))) R (((1 <= p272)) AND ((p173 <= 0))))))",
"processed_size": 111,
"rewrites": 34
},
"result":
{
"edges": 210,
"markings": 210,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p333)) AND ((p302 <= 0))))))",
"processed_size": 45,
"rewrites": 34
},
"result":
{
"edges": 210,
"markings": 210,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p242 <= 0)) OR ((1 <= p8)))))",
"processed_size": 39,
"rewrites": 34
},
"result":
{
"edges": 423,
"markings": 367,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p81 <= 0)))",
"processed_size": 16,
"rewrites": 34
},
"result":
{
"edges": 438,
"markings": 379,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p81)) AND ((p34 <= 0)))",
"processed_size": 31,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p81)) AND ((p34 <= 0)))",
"processed_size": 31,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p298)) AND ((p218 <= 0)))))",
"processed_size": 41,
"rewrites": 34
},
"result":
{
"edges": 90,
"markings": 90,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23168,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : X((* R (* R *))) : X(X(G(**))) : G(**) : (G(F(*)) OR **)"
},
"net":
{
"arcs": 852,
"conflict_clusters": 289,
"places": 367,
"places_significant": 310,
"singleton_clusters": 0,
"transitions": 318
},
"result":
{
"preliminary_value": "no no no no no ",
"value": "no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 685/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 367
lola: finding significant places
lola: 367 places, 318 transitions, 310 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p359 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p302 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: X (G (F (X (X (G ((((p242 <= 0)) OR ((1 <= p8))))))))) : X (NOT(((((p279 <= 0)) OR ((1 <= p359))) U ((((p5 <= 0)) OR ((1 <= p136))) U (((p272 <= 0)) OR ((1 <= p173))))))) : G (NOT(F (NOT((X (NOT(F (((1 <= 0) U (0 <= 0))))) U X (X ((((1 <= p333)) AND ((p302 <= 0)))))))))) : G (((p81 <= 0))) : (X (F (G (NOT(G ((((p298 <= 0)) OR ((1 <= p218)))))))) OR (((1 <= p81)) AND ((p34 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p279)) AND ((p359 <= 0))) R ((((1 <= p5)) AND ((p136 <= 0))) R (((1 <= p272)) AND ((p173 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p279)) AND ((p359 <= 0))) R ((((1 <= p5)) AND ((p136 <= 0))) R (((1 <= p272)) AND ((p173 <= 0))))))
lola: processed formula length: 111
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 210 markings, 210 edges
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p333)) AND ((p302 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p333)) AND ((p302 <= 0))))))
lola: processed formula length: 45
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 210 markings, 210 edges
lola: ========================================
lola: subprocess 2 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p242 <= 0)) OR ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p242 <= 0)) OR ((1 <= p8)))))
lola: processed formula length: 39
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 367 markings, 423 edges
lola: ========================================
lola: subprocess 3 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p81 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p81 <= 0)))
lola: processed formula length: 16
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 379 markings, 438 edges
lola: ========================================
lola: subprocess 4 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((1 <= p298)) AND ((p218 <= 0))))) OR (((1 <= p81)) AND ((p34 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p81)) AND ((p34 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p81)) AND ((p34 <= 0)))
lola: processed formula length: 31
lola: 34 rewrites
lola: closed formula file LTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((((1 <= p298)) AND ((p218 <= 0))))) OR (((1 <= p81)) AND ((p34 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p81)) AND ((p34 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p81)) AND ((p34 <= 0)))
lola: processed formula length: 31
lola: 34 rewrites
lola: closed formula file LTLCardinality.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: ========================================
lola: ...considering subproblem: G (F ((((1 <= p298)) AND ((p218 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p298)) AND ((p218 <= 0)))))
lola: processed formula length: 41
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 90 markings, 90 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no
lola:
preliminary result: no no no no no
lola: memory consumption: 23168 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="BusinessProcesses-PT-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BusinessProcesses-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038177000177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;