About the Execution of 2020-gold for BusinessProcesses-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16253.392 | 3600000.00 | 3521937.00 | 110162.20 | F?T????F??????T? | normal |
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.r035-tajo-162038167700091.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-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700091
=====================================================================
--------------------
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 130K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.2K 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.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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-06-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1620904318373
[2021-05-13 11:11:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 11:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:12:00] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-13 11:12:00] [INFO ] Transformed 376 places.
[2021-05-13 11:12:00] [INFO ] Transformed 297 transitions.
[2021-05-13 11:12:00] [INFO ] Found NUPN structural information;
[2021-05-13 11:12:00] [INFO ] Parsed PT model containing 376 places and 297 transitions in 108 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Incomplete random walk after 100000 steps, including 1038 resets, run finished after 1367 ms. (steps per millisecond=73 ) properties seen :[1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0]
// Phase 1: matrix 296 rows 375 cols
[2021-05-13 11:12:01] [INFO ] Computed 81 place invariants in 29 ms
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 42 positive place invariants in 29 ms returned unsat
[2021-05-13 11:12:01] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:02] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:02] [INFO ] [Real]Absence check using 42 positive place invariants in 28 ms returned sat
[2021-05-13 11:12:02] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 19 ms returned sat
[2021-05-13 11:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:02] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 9 places in 195 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2021-05-13 11:12:02] [INFO ] Deduced a trap composed of 18 places in 128 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 11 places in 140 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 16 places in 127 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 24 places in 134 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 77 places in 99 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 24 places in 106 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 19 places in 111 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 83 places in 106 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 84 places in 146 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 85 places in 90 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 83 places in 102 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 83 places in 87 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 83 places in 85 ms
[2021-05-13 11:12:04] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2338 ms
[2021-05-13 11:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:04] [INFO ] [Nat]Absence check using 42 positive place invariants in 42 ms returned sat
[2021-05-13 11:12:05] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 23 ms returned sat
[2021-05-13 11:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:05] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 9 places in 173 ms
[2021-05-13 11:12:05] [INFO ] Deduced a trap composed of 18 places in 311 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 18 places in 125 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 11 places in 124 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 17 places in 97 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 19 places in 102 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 24 places in 92 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 78 places in 107 ms
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 20 places in 96 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 81 places in 108 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 79 places in 112 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 80 places in 106 ms
[2021-05-13 11:12:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1902 ms
[2021-05-13 11:12:07] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 21 ms.
[2021-05-13 11:12:08] [INFO ] Added : 235 causal constraints over 48 iterations in 1180 ms. Result :sat
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 82 places in 112 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 85 places in 128 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 79 places in 106 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 81 places in 101 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 83 places in 112 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 78 places in 249 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 74 places in 251 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 76 places in 240 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 78 places in 287 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 80 places in 289 ms
[2021-05-13 11:12:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2356 ms
[2021-05-13 11:12:10] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 42 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 42 positive place invariants in 44 ms returned unsat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-13 11:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:11] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 16 places in 110 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 11 places in 135 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 12 places in 116 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 10 places in 118 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 19 places in 102 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 20 places in 132 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 14 places in 125 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 17 places in 116 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 16 places in 97 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 22 places in 88 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 19 places in 129 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 23 places in 114 ms
[2021-05-13 11:12:13] [INFO ] Deduced a trap composed of 77 places in 84 ms
[2021-05-13 11:12:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1675 ms
[2021-05-13 11:12:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:13] [INFO ] [Nat]Absence check using 42 positive place invariants in 30 ms returned sat
[2021-05-13 11:12:13] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 17 ms returned sat
[2021-05-13 11:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:13] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 16 places in 118 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 11 places in 101 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 10 places in 103 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 13 places in 163 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 14 places in 138 ms
[2021-05-13 11:12:14] [INFO ] Deduced a trap composed of 22 places in 136 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 14 places in 88 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 16 places in 150 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 23 places in 80 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 18 places in 92 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 16 places in 79 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 20 places in 129 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 21 places in 81 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2021-05-13 11:12:15] [INFO ] Deduced a trap composed of 23 places in 89 ms
[2021-05-13 11:12:16] [INFO ] Deduced a trap composed of 18 places in 105 ms
[2021-05-13 11:12:16] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2132 ms
[2021-05-13 11:12:16] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 22 ms.
[2021-05-13 11:12:17] [INFO ] Added : 216 causal constraints over 44 iterations in 983 ms. Result :sat
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 94 places in 106 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 84 places in 86 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 91 places in 107 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 82 places in 99 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 86 places in 92 ms
[2021-05-13 11:12:17] [INFO ] Deduced a trap composed of 82 places in 136 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 83 places in 118 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 76 places in 142 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 76 places in 124 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 74 places in 92 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 78 places in 107 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 81 places in 89 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 77 places in 158 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 76 places in 152 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 79 places in 146 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 79 places in 103 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 78 places in 126 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 79 places in 116 ms
[2021-05-13 11:12:20] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3017 ms
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 42 positive place invariants in 42 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 23 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2021-05-13 11:12:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:20] [INFO ] [Nat]Absence check using 42 positive place invariants in 43 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 24 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:21] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 17 places in 141 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 13 places in 62 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 18 places in 70 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 18 places in 66 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 15 places in 57 ms
[2021-05-13 11:12:21] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 17 places in 77 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 11 places in 182 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 84 places in 113 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 15 places in 133 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 24 places in 56 ms
[2021-05-13 11:12:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1508 ms
[2021-05-13 11:12:22] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 12 ms.
[2021-05-13 11:12:23] [INFO ] Added : 293 causal constraints over 60 iterations in 1295 ms. Result :sat
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 75 places in 135 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 78 places in 115 ms
[2021-05-13 11:12:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 377 ms
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 24 ms returned sat
[2021-05-13 11:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:24] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2021-05-13 11:12:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:24] [INFO ] [Nat]Absence check using 42 positive place invariants in 40 ms returned sat
[2021-05-13 11:12:24] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 20 ms returned sat
[2021-05-13 11:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:25] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 15 places in 89 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 18 places in 171 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 17 places in 127 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 15 places in 126 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 22 places in 124 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 16 places in 61 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 21 places in 32 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 14 places in 43 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 20 places in 39 ms
[2021-05-13 11:12:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1189 ms
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned unsat
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2021-05-13 11:12:26] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned sat
[2021-05-13 11:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:27] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2021-05-13 11:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:27] [INFO ] [Nat]Absence check using 42 positive place invariants in 22 ms returned unsat
[2021-05-13 11:12:27] [INFO ] [Real]Absence check using 42 positive place invariants in 21 ms returned unsat
[2021-05-13 11:12:27] [INFO ] [Real]Absence check using 42 positive place invariants in 28 ms returned sat
[2021-05-13 11:12:27] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 20 ms returned sat
[2021-05-13 11:12:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:27] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2021-05-13 11:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:27] [INFO ] [Nat]Absence check using 42 positive place invariants in 23 ms returned unsat
[2021-05-13 11:12:27] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:27] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:27] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 28 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned unsat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive place invariants in 28 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 23 ms returned sat
[2021-05-13 11:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2021-05-13 11:12:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:29] [INFO ] [Nat]Absence check using 42 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using 42 positive place invariants in 41 ms returned sat
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 22 ms returned sat
[2021-05-13 11:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:29] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 15 places in 98 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 16 places in 143 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 18 places in 87 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 17 places in 81 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 19 places in 80 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 20 places in 93 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 21 places in 92 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 20 places in 103 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 19 places in 101 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 81 places in 79 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 11 places in 137 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 22 places in 109 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 17 places in 98 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 13 places in 95 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 82 places in 101 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 14 places in 88 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 81 places in 96 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 11 places in 85 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 82 places in 90 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 81 places in 102 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 79 places in 89 ms
[2021-05-13 11:12:32] [INFO ] Deduced a trap composed of 81 places in 63 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 88 places in 61 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 80 places in 59 ms
[2021-05-13 11:12:33] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3274 ms
[2021-05-13 11:12:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:33] [INFO ] [Nat]Absence check using 42 positive place invariants in 27 ms returned sat
[2021-05-13 11:12:33] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-13 11:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:33] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2021-05-13 11:12:33] [INFO ] Deduced a trap composed of 11 places in 165 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 16 places in 137 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 18 places in 138 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 19 places in 137 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 20 places in 120 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 84 places in 92 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2021-05-13 11:12:34] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 20 places in 114 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 81 places in 118 ms
[2021-05-13 11:12:35] [INFO ] Deduced a trap composed of 20 places in 57 ms
[2021-05-13 11:12:35] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1919 ms
[2021-05-13 11:12:35] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 29 ms.
[2021-05-13 11:12:36] [INFO ] Added : 228 causal constraints over 46 iterations in 857 ms. Result :sat
[2021-05-13 11:12:36] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:36] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned sat
[2021-05-13 11:12:36] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned sat
[2021-05-13 11:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:36] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-13 11:12:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:36] [INFO ] [Nat]Absence check using 42 positive place invariants in 40 ms returned sat
[2021-05-13 11:12:36] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 17 ms returned sat
[2021-05-13 11:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:37] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 14 places in 86 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 16 places in 102 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 15 places in 88 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 17 places in 83 ms
[2021-05-13 11:12:37] [INFO ] Deduced a trap composed of 11 places in 104 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 83 places in 99 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 83 places in 96 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 19 places in 56 ms
[2021-05-13 11:12:38] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2021-05-13 11:12:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1183 ms
[2021-05-13 11:12:38] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 16 ms.
[2021-05-13 11:12:38] [INFO ] Added : 25 causal constraints over 5 iterations in 116 ms. Result :sat
[2021-05-13 11:12:38] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:38] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned unsat
[2021-05-13 11:12:38] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:38] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:38] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:38] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 27 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:39] [INFO ] [Real]Absence check using 42 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:40] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned unsat
Successfully simplified 53 atomic propositions for a total of 53 simplifications.
[2021-05-13 11:12:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 11:12:40] [INFO ] Flatten gal took : 101 ms
[2021-05-13 11:12:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 11:12:40] [INFO ] Flatten gal took : 30 ms
FORMULA BusinessProcesses-PT-06-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:12:40] [INFO ] Applying decomposition
[2021-05-13 11:12:40] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph3616493751914377745.txt, -o, /tmp/graph3616493751914377745.bin, -w, /tmp/graph3616493751914377745.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3616493751914377745.bin, -l, -1, -v, -w, /tmp/graph3616493751914377745.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:40] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:40] [INFO ] Removed a total of 43 redundant transitions.
[2021-05-13 11:12:40] [INFO ] Flatten gal took : 94 ms
[2021-05-13 11:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 24 ms.
[2021-05-13 11:12:41] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 12 ms
[2021-05-13 11:12:41] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91565e+18,300.045,4886060,2,4.03092e+06,5,1.86324e+07,6,0,1791,1.52882e+07,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,300.463,4886060,1,0,6,1.86324e+07,7,1,2120,1.52882e+07,1
FORMULA BusinessProcesses-PT-06-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2021-05-13 11:32:56] [INFO ] Applying decomposition
[2021-05-13 11:32:57] [INFO ] Flatten gal took : 778 ms
[2021-05-13 11:32:57] [INFO ] Decomposing Gal with order
[2021-05-13 11:32:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:32:57] [INFO ] Flatten gal took : 139 ms
[2021-05-13 11:32:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-13 11:32:58] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 109 ms
[2021-05-13 11:32:58] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91565e+18,955.299,11816532,2,1.15797e+07,5,4.59618e+07,6,0,1792,3.67436e+07,0
Converting to forward existential form...Done !
original formula: (!(E(((((((((((gi1.gu118.p312+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu79.p185)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi1.gu140.p65)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu86.p222)+gi1.gu118.p292)+gi0.gi0.gi0.gi0.gu54.p138)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p45)+gi0.gi0.gi0.gi0.gu130.p4)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu76.p171)>=6) + EX((((((gi1.gu118.p270+gi1.gi0.gi0.gi0.gi0.gi0.gu105.p358)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu81.p196)>=9)||(((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p39+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.p55)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p47)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu79.p188)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu17.p32)<=1))&&((((gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p21+gi0.gi0.gu128.p2)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu114.p166)+gi1.gu118.p273)>((((((gi0.gi1.gi0.gi0.gu93.p255+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu19.p39)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu86.p221)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu76.p173)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu79.p185)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu22.p58)+gi0.gi0.gu56.p149))))) U (((((((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu84.p214+gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu104.p355)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu164.p161)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu157.p156)+gi1.gu118.p274)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu90.p241)+gi1.gi0.gi0.gi0.gu107.p366)+gi0.gi1.gi0.gi0.gu154.p153)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu15.p17)<=(((((((gi0.gi0.gi0.gi0.gu130.p4+gi1.gu118.p326)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi1.gu37.p94)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu16.p25)+gu126.p0)+gi0.gi0.gu56.p150)+gi0.gi0.gi0.gi0.gi0.gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu45.p107)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.p56)))) + EX(((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu86.p221+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu78.p183)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.p35)<7)&&((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu45.p108+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu79.p188)+gi1.gu118.p285)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.p54)+gi1.gu118.p311)+gi0.gi0.gi0.gi0.gi0.gi0.gi1.gu147.p98)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi1.gi0.gi0.gu35.p88)>(gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu77.p175+gi0.gi1.gi0.gi0.gi0.gu92.p250))||(((((gi1.gu118.p327+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi1.gi0.gu139.p67)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi1.gu140.p64)+gi1.gu118.p342)+gi0.gi0.gi0.gi0.gi0.gi0.gi1.gu147.p99)>((((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gu90.p243+gi0.gi0.gi0.gi0.gi0.gu53.p136)+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu77.p175)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu20.p48)+gi1.gu118.p276)+gi0.gi0.gu56.p148)+gi1.gu118.p331))))))
Detected timeout of ITS tools.
=> equivalent forward existential formula: [(FwdU((Init * !(EX(((((gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu86.p221+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu78.p183)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu18.p35)<7)&&((((((((gi0.gi0.gi0.gi0.gi0.gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gu45.p108+gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu79.p188)+gi1.gu118.p285)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu21.p54)+gi1.gu118.p311)+gi0.gi0.gi0.gi0.gi0.gi0.gi1.gu147.p98)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi1.gi0.gi0.gu35.p88)>(gi0.gi1.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi0.gu77.p175+gi0.gi1.gi0.gi0.gi0.gu92.p250))||(((((gi1.gu118.p327+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi1.gi0.gu139.p67)+gi0.gi0.gi0.gi0.gi0.gi0.gi0.gi1.gu140.p64)+gi1.gu118.p342)+gi0.gi0.gi0.gi0.gi0.gi0
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:180)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-13 11:53:11] [INFO ] Flatten gal took : 23 ms
[2021-05-13 11:53:11] [INFO ] Input system was already deterministic with 296 transitions.
[2021-05-13 11:53:11] [INFO ] Transformed 375 places.
[2021-05-13 11:53:11] [INFO ] Transformed 296 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 11:53:41] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 8 ms
[2021-05-13 11:53:41] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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-06"
export BK_EXAMINATION="CTLCardinality"
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-06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tajo-162038167700091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;