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.r026-tajo-162038143900422.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 itstools
Input is BusinessProcesses-PT-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 5 16:58 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:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 3.4K 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:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:15 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 148K 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-13-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620545756324

Running Version 0
[2021-05-09 07:35:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:35:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:35:57] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-09 07:35:57] [INFO ] Transformed 593 places.
[2021-05-09 07:35:57] [INFO ] Transformed 536 transitions.
[2021-05-09 07:35:57] [INFO ] Found NUPN structural information;
[2021-05-09 07:35:57] [INFO ] Parsed PT model containing 593 places and 536 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 72 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :5
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 528 rows 585 cols
[2021-05-09 07:35:58] [INFO ] Computed 95 place invariants in 43 ms
[2021-05-09 07:35:58] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2021-05-09 07:35:58] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2021-05-09 07:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:58] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-09 07:35:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:35:58] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned unsat
[2021-05-09 07:35:58] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2021-05-09 07:35:58] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 07:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:35:59] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:35:59] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 6 ms to minimize.
[2021-05-09 07:35:59] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:35:59] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:35:59] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:36:00] [INFO ] Deduced a trap composed of 117 places in 164 ms of which 15 ms to minimize.
[2021-05-09 07:36:01] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 1 ms to minimize.
[2021-05-09 07:36:01] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2021-05-09 07:36:01] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:36:01] [INFO ] Deduced a trap composed of 127 places in 211 ms of which 0 ms to minimize.
[2021-05-09 07:36:01] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 0 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:36:02] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 129 places in 161 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:36:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-09 07:36:04] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-09 07:36:04] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2021-05-09 07:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:04] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-09 07:36:04] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:36:04] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:36:04] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:36:04] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:36:04] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:36:05] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:36:05] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:36:05] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2021-05-09 07:36:05] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:36:05] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:36:05] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:36:05] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:36:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1674 ms
[2021-05-09 07:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:36:06] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2021-05-09 07:36:06] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 07:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:06] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2021-05-09 07:36:06] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:36:06] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:36:06] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:36:06] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 4 ms to minimize.
[2021-05-09 07:36:06] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:36:06] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:36:07] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:36:07] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:36:07] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2021-05-09 07:36:07] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:36:07] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:36:07] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:36:07] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2021-05-09 07:36:07] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:36:08] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:36:08] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:36:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1975 ms
[2021-05-09 07:36:08] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 40 ms.
[2021-05-09 07:36:09] [INFO ] Deduced a trap composed of 116 places in 162 ms of which 1 ms to minimize.
[2021-05-09 07:36:10] [INFO ] Deduced a trap composed of 121 places in 153 ms of which 1 ms to minimize.
[2021-05-09 07:36:10] [INFO ] Deduced a trap composed of 125 places in 167 ms of which 3 ms to minimize.
[2021-05-09 07:36:10] [INFO ] Deduced a trap composed of 117 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:36:10] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:36:10] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:36:10] [INFO ] Deduced a trap composed of 116 places in 150 ms of which 0 ms to minimize.
[2021-05-09 07:36:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-09 07:36:11] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2021-05-09 07:36:11] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2021-05-09 07:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:11] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-09 07:36:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:36:11] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2021-05-09 07:36:11] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 07:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:11] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-09 07:36:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:36:11] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2021-05-09 07:36:11] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 07:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:12] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-09 07:36:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:36:12] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2021-05-09 07:36:12] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-09 07:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:36:12] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2021-05-09 07:36:12] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:36:12] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:36:13] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 1 ms to minimize.
[2021-05-09 07:36:13] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:36:13] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 1 ms to minimize.
[2021-05-09 07:36:13] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2021-05-09 07:36:13] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:36:14] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2021-05-09 07:36:14] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:36:14] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2021-05-09 07:36:14] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:36:14] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:36:15] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:36:15] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:36:15] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:36:15] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 1 ms to minimize.
[2021-05-09 07:36:15] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 0 ms to minimize.
[2021-05-09 07:36:15] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:36:16] [INFO ] Deduced a trap composed of 150 places in 173 ms of which 0 ms to minimize.
[2021-05-09 07:36:16] [INFO ] Deduced a trap composed of 157 places in 179 ms of which 1 ms to minimize.
[2021-05-09 07:36:16] [INFO ] Deduced a trap composed of 127 places in 162 ms of which 0 ms to minimize.
[2021-05-09 07:36:16] [INFO ] Deduced a trap composed of 149 places in 177 ms of which 0 ms to minimize.
[2021-05-09 07:36:16] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 1 ms to minimize.
[2021-05-09 07:36:17] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 1 ms to minimize.
[2021-05-09 07:36:17] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 0 ms to minimize.
[2021-05-09 07:36:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Support contains 9 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 329 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 575 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 575 transition count 394
Reduce places removed 126 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 130 rules applied. Total rules applied 258 place count 449 transition count 390
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 262 place count 445 transition count 390
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 262 place count 445 transition count 303
Deduced a syphon composed of 87 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 452 place count 342 transition count 303
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 527 place count 267 transition count 228
Iterating global reduction 3 with 75 rules applied. Total rules applied 602 place count 267 transition count 228
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 602 place count 267 transition count 220
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 257 transition count 220
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 794 place count 169 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 796 place count 168 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 798 place count 168 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 800 place count 166 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 801 place count 166 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 802 place count 165 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 803 place count 164 transition count 135
Applied a total of 803 rules in 217 ms. Remains 164 /585 variables (removed 421) and now considering 135/528 (removed 393) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/585 places, 135/528 transitions.
[2021-05-09 07:36:17] [INFO ] Flatten gal took : 73 ms
[2021-05-09 07:36:17] [INFO ] Flatten gal took : 21 ms
[2021-05-09 07:36:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18037058116881376940.gal : 16 ms
[2021-05-09 07:36:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8543346060524849788.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality18037058116881376940.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8543346060524849788.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality18037058116881376940.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8543346060524849788.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8543346060524849788.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 30
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :30 after 62
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :62 after 550
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :550 after 822
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :822 after 2684
Reachability property BusinessProcesses-PT-13-ReachabilityCardinality-05 is true.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-13-ReachabilityCardinality-01 is true.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2684 after 8132
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8132 after 14076
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :14076 after 25516
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,37148,0.374702,15464,2,6039,17,37811,7,0,796,30312,0
Total reachable state count : 37148

Verifying 3 reachability properties.
Reachability property BusinessProcesses-PT-13-ReachabilityCardinality-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-13-ReachabilityCardinality-01,192,0.376399,15728,2,271,17,37811,8,0,802,30312,0
Reachability property BusinessProcesses-PT-13-ReachabilityCardinality-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-13-ReachabilityCardinality-05,8,0.376816,15728,2,172,17,37811,9,0,807,30312,0
Reachability property BusinessProcesses-PT-13-ReachabilityCardinality-15 is true.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-13-ReachabilityCardinality-15,48,0.379768,15728,2,234,17,37811,9,0,815,30312,0
All properties solved without resorting to model-checking.

BK_STOP 1620545778445

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-13"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-13, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143900422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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