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-162038177000169.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-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.5K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K 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 63K 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-03-00
FORMULA_NAME BusinessProcesses-PT-03-01
FORMULA_NAME BusinessProcesses-PT-03-02
FORMULA_NAME BusinessProcesses-PT-03-03
FORMULA_NAME BusinessProcesses-PT-03-04
FORMULA_NAME BusinessProcesses-PT-03-05
FORMULA_NAME BusinessProcesses-PT-03-06
FORMULA_NAME BusinessProcesses-PT-03-07
FORMULA_NAME BusinessProcesses-PT-03-08
FORMULA_NAME BusinessProcesses-PT-03-09
FORMULA_NAME BusinessProcesses-PT-03-10
FORMULA_NAME BusinessProcesses-PT-03-11
FORMULA_NAME BusinessProcesses-PT-03-12
FORMULA_NAME BusinessProcesses-PT-03-13
FORMULA_NAME BusinessProcesses-PT-03-14
FORMULA_NAME BusinessProcesses-PT-03-15

=== Now, execution of the tool begins

BK_START 1620936061025

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:01:02] [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:01:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:01:02] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-13 20:01:02] [INFO ] Transformed 274 places.
[2021-05-13 20:01:02] [INFO ] Transformed 237 transitions.
[2021-05-13 20:01:02] [INFO ] Found NUPN structural information;
[2021-05-13 20:01:02] [INFO ] Parsed PT model containing 274 places and 237 transitions in 88 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 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1188 resets, run finished after 183 ms. (steps per millisecond=546 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 236 rows 273 cols
[2021-05-13 20:01:02] [INFO ] Computed 43 place invariants in 16 ms
[2021-05-13 20:01:03] [INFO ] [Real]Absence check using 31 positive place invariants in 36 ms returned sat
[2021-05-13 20:01:03] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-13 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:03] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-13 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2021-05-13 20:01:03] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:03] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 15 places in 132 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 35 places in 38 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 21 places in 43 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 13 places in 47 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 23 places in 38 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 40 places in 35 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 46 places in 34 ms
[2021-05-13 20:01:04] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 783 ms
[2021-05-13 20:01:04] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 22 ms.
[2021-05-13 20:01:05] [INFO ] Added : 152 causal constraints over 31 iterations in 650 ms. Result :sat
[2021-05-13 20:01:05] [INFO ] [Real]Absence check using 31 positive place invariants in 32 ms returned sat
[2021-05-13 20:01:05] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:05] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-13 20:01:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2021-05-13 20:01:05] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2021-05-13 20:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:05] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 26 places in 77 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 20 places in 79 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 12 places in 69 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 13 places in 74 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 20 places in 92 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 28 places in 129 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 32 places in 89 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 14 places in 113 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 72 places in 94 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 19 places in 94 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 35 places in 134 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 74 places in 87 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 35 places in 66 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 37 places in 81 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 69 places in 66 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 41 places in 46 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 43 places in 42 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 31 places in 61 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 37 places in 60 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 70 places in 61 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 42 places in 68 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 47 places in 77 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 20 places in 45 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 40 places in 40 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 41 places in 301 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 28 places in 42 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 30 places in 39 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 36 places in 940 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 34 places in 44 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 69 places in 63 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 71 places in 61 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 74 places in 60 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 75 places in 64 ms
[2021-05-13 20:01:09] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 4020 ms
[2021-05-13 20:01:09] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 19 ms.
[2021-05-13 20:01:10] [INFO ] Added : 179 causal constraints over 36 iterations in 601 ms. Result :sat
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 68 places in 66 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 69 places in 60 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 72 places in 111 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 72 places in 62 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 71 places in 103 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 71 places in 83 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 71 places in 88 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 72 places in 63 ms
[2021-05-13 20:01:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 980 ms
[2021-05-13 20:01:11] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2021-05-13 20:01:11] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2021-05-13 20:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:11] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2021-05-13 20:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2021-05-13 20:01:11] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:11] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 8 places in 94 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 11 places in 103 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 13 places in 84 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 22 places in 90 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 18 places in 98 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 28 places in 111 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 29 places in 87 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 36 places in 60 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 37 places in 113 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 28 places in 84 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 14 places in 77 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 26 places in 108 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 29 places in 56 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 23 places in 76 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 37 places in 72 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 33 places in 50 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 30 places in 52 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 34 places in 46 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 37 places in 40 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 36 places in 40 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 36 places in 39 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 28 places in 74 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 34 places in 76 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 36 places in 53 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 37 places in 33 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 45 places in 33 ms
[2021-05-13 20:01:14] [INFO ] Deduced a trap composed of 46 places in 31 ms
[2021-05-13 20:01:14] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 2709 ms
[2021-05-13 20:01:14] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 11 ms.
[2021-05-13 20:01:15] [INFO ] Added : 179 causal constraints over 36 iterations in 446 ms. Result :sat
[2021-05-13 20:01:15] [INFO ] Deduced a trap composed of 70 places in 59 ms
[2021-05-13 20:01:15] [INFO ] Deduced a trap composed of 75 places in 89 ms
[2021-05-13 20:01:15] [INFO ] Deduced a trap composed of 80 places in 68 ms
[2021-05-13 20:01:15] [INFO ] Deduced a trap composed of 72 places in 71 ms
[2021-05-13 20:01:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 374 ms
[2021-05-13 20:01:15] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2021-05-13 20:01:15] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:15] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-13 20:01:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2021-05-13 20:01:15] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-13 20:01:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:16] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 13 places in 131 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 12 places in 69 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 19 places in 66 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 15 places in 54 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 29 places in 88 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2021-05-13 20:01:16] [INFO ] Deduced a trap composed of 28 places in 93 ms
[2021-05-13 20:01:17] [INFO ] Deduced a trap composed of 36 places in 81 ms
[2021-05-13 20:01:17] [INFO ] Deduced a trap composed of 37 places in 92 ms
[2021-05-13 20:01:17] [INFO ] Deduced a trap composed of 27 places in 85 ms
[2021-05-13 20:01:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1225 ms
[2021-05-13 20:01:17] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 13 ms.
[2021-05-13 20:01:17] [INFO ] Added : 132 causal constraints over 27 iterations in 426 ms. Result :sat
[2021-05-13 20:01:17] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2021-05-13 20:01:17] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:18] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-13 20:01:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
[2021-05-13 20:01:18] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-13 20:01:18] [INFO ] Flatten gal took : 51 ms
FORMULA BusinessProcesses-PT-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:01:18] [INFO ] Applying decomposition
[2021-05-13 20:01:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 20:01:18] [INFO ] Flatten gal took : 17 ms
[2021-05-13 20:01:18] [INFO ] Decomposing Gal with order
[2021-05-13 20:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 20:01:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 20:01:18] [INFO ] Flatten gal took : 42 ms
[2021-05-13 20:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-13 20:01:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:01:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 20:01:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-03 @ 3570 seconds

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

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

FORMULA BusinessProcesses-PT-03-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

{
"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:01:18 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((((1 <= p268)) AND ((p154 <= 0)))))",
"processed_size": 41,
"rewrites": 24
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 6,
"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": "X (X (X (X (X (X (G ((((p65 <= 0)) OR ((1 <= p36))))))))))",
"processed_size": 59,
"rewrites": 24
},
"result":
{
"edges": 8257369,
"markings": 1074322,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 887
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 887
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 3,
"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": "((((1 <= p221)) AND ((p156 <= 0))) U ((1 <= p134)))",
"processed_size": 51,
"rewrites": 24
},
"result":
{
"edges": 68,
"markings": 68,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((((p250 <= 0)) OR ((1 <= p64)))))",
"processed_size": 40,
"rewrites": 24
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((X ((((1 <= p69)) AND ((p156 <= 0)))) AND F ((((1 <= p69)) AND ((p156 <= 0)))))))",
"processed_size": 87,
"rewrites": 24
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"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": 1775
},
"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 ((((p178 <= 0)) OR ((1 <= p210)))))",
"processed_size": 41,
"rewrites": 24
},
"result":
{
"edges": 302,
"markings": 257,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3550
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 8,
"adisj": 4,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((((p23 <= 0)) OR ((p229 <= 1) AND (1 <= p229))) U (((p183 <= 0)) OR ((1 <= p209)))) OR (G ((((p183 <= 0)) OR ((1 <= p209)))) AND (((p183 <= 0)) OR ((1 <= p209))))))",
"processed_size": 173,
"rewrites": 24
},
"result":
{
"edges": 399,
"markings": 311,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 29292,
"runtime": 20.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(((** U **) OR (G(**) AND **))) : X(G(*)) : X(X(X(X(X(X(G(**))))))) : ((** U **) OR X(F(**))) : X(G((X(*) AND F(*)))) : F(G(**))"
},
"net":
{
"arcs": 630,
"conflict_clusters": 215,
"places": 273,
"places_significant": 230,
"singleton_clusters": 0,
"transitions": 236
},
"result":
{
"preliminary_value": "no no no yes no no ",
"value": "no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 509/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 273
lola: finding significant places
lola: 273 places, 236 transitions, 230 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: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: G ((((((p23 <= 0)) OR ((p229 <= 1) AND (1 <= p229))) U (((p183 <= 0)) OR ((1 <= p209)))) OR (G ((((p183 <= 0)) OR ((1 <= p209)))) AND (((p183 <= 0)) OR ((1 <= p209)))))) : NOT(F ((F ((((p268 <= 0)) OR ((1 <= p154)))) U X ((((p268 <= 0)) OR ((1 <= p154))))))) : X (X (G (X (X (X (G (X (((1 <= 0) U G ((((p65 <= 0)) OR ((1 <= p36))))))))))))) : (((((1 <= p221)) AND ((p156 <= 0))) U ((1 <= p134))) OR X (F ((((p250 <= 0)) OR ((1 <= p64)))))) : X (NOT(((F ((((p118 <= 0)) OR ((1 <= p114)))) U ((1 <= p165))) U F ((X ((((p69 <= 0)) OR ((1 <= p156)))) OR G ((((p69 <= 0)) OR ((1 <= p156))))))))) : (((((p178 <= 0)) OR ((1 <= p210))) U F ((((1 <= p178)) AND ((p210 <= 0))))) U X (F (G ((((p178 <= 0)) OR ((1 <= p210)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p268)) AND ((p154 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p268)) AND ((p154 <= 0)))))
lola: processed formula length: 41
lola: 24 rewrites
lola: closed formula file LTLCardinality.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: 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: 149 markings, 149 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (X (X (G ((((p65 <= 0)) OR ((1 <= p36))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (X (X (G ((((p65 <= 0)) OR ((1 <= p36))))))))))
lola: processed formula length: 59
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 334483 markings, 2463716 edges, 66897 markings/sec, 0 secs
lola: 658858 markings, 4981694 edges, 64875 markings/sec, 5 secs
lola: 987402 markings, 7538714 edges, 65709 markings/sec, 10 secs
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: 1074322 markings, 8257369 edges
lola: ========================================
lola: subprocess 2 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p221)) AND ((p156 <= 0))) U ((1 <= p134))) OR X (F ((((p250 <= 0)) OR ((1 <= p64))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p221)) AND ((p156 <= 0))) U ((1 <= p134)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p221)) AND ((p156 <= 0))) U ((1 <= p134)))
lola: processed formula length: 51
lola: 24 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: 68 markings, 68 edges
lola: ========================================
lola: subprocess 3 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p250 <= 0)) OR ((1 <= p64)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p250 <= 0)) OR ((1 <= p64)))))
lola: processed formula length: 40
lola: 24 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: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((((1 <= p69)) AND ((p156 <= 0)))) AND F ((((1 <= p69)) AND ((p156 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((((1 <= p69)) AND ((p156 <= 0)))) AND F ((((1 <= p69)) AND ((p156 <= 0)))))))
lola: processed formula length: 87
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 149 markings, 149 edges
lola: ========================================
lola: subprocess 4 will run for 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p178 <= 0)) OR ((1 <= p210)))))
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 ((((p178 <= 0)) OR ((1 <= p210)))))
lola: processed formula length: 41
lola: 24 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: 257 markings, 302 edges
lola: ========================================
lola: subprocess 5 will run for 3550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((((p23 <= 0)) OR ((p229 <= 1) AND (1 <= p229))) U (((p183 <= 0)) OR ((1 <= p209)))) OR (G ((((p183 <= 0)) OR ((1 <= p209)))) AND (((p183 <= 0)) OR ((1 <= p209))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((((p23 <= 0)) OR ((p229 <= 1) AND (1 <= p229))) U (((p183 <= 0)) OR ((1 <= p209)))) OR (G ((((p183 <= 0)) OR ((1 <= p209)))) AND (((p183 <= 0)) OR ((1 <= p209))))))
lola: processed formula length: 173
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 311 markings, 399 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no
lola:
preliminary result: no no no yes no no
lola: memory consumption: 29292 KB
lola: time consumption: 20 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-03"
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-03, 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-162038177000169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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