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-162038143900470.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-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.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 189K 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-19-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620548593273

Running Version 0
[2021-05-09 08:23:14] [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 08:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:23:14] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2021-05-09 08:23:14] [INFO ] Transformed 772 places.
[2021-05-09 08:23:14] [INFO ] Transformed 685 transitions.
[2021-05-09 08:23:14] [INFO ] Found NUPN structural information;
[2021-05-09 08:23:15] [INFO ] Parsed PT model containing 772 places and 685 transitions in 125 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 15 places in 17 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :4
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 670 rows 757 cols
[2021-05-09 08:23:15] [INFO ] Computed 125 place invariants in 33 ms
[2021-05-09 08:23:15] [INFO ] [Real]Absence check using 78 positive place invariants in 47 ms returned sat
[2021-05-09 08:23:15] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 28 ms returned sat
[2021-05-09 08:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:16] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2021-05-09 08:23:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:16] [INFO ] [Real]Absence check using 78 positive place invariants in 25 ms returned sat
[2021-05-09 08:23:16] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 08:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:16] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-09 08:23:16] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 3 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 1 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 2 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 2 ms to minimize.
[2021-05-09 08:23:17] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 0 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:23:18] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:23:19] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 172 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:23:20] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 165 places in 171 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:23:21] [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 08:23:21] [INFO ] [Real]Absence check using 78 positive place invariants in 29 ms returned sat
[2021-05-09 08:23:21] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2021-05-09 08:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:21] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-09 08:23:21] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:23:22] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 6 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:23:23] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:23:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2265 ms
[2021-05-09 08:23:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:24] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2021-05-09 08:23:24] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2021-05-09 08:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:24] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2021-05-09 08:23:24] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 2 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 160 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 1 ms to minimize.
[2021-05-09 08:23:25] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 1 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:23:26] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:23:27] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 9 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 174 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2021-05-09 08:23:28] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4321 ms
[2021-05-09 08:23:28] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 45 ms.
[2021-05-09 08:23:29] [INFO ] Added : 15 causal constraints over 3 iterations in 219 ms. Result :unknown
[2021-05-09 08:23:29] [INFO ] [Real]Absence check using 78 positive place invariants in 26 ms returned sat
[2021-05-09 08:23:29] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2021-05-09 08:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:29] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-09 08:23:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:29] [INFO ] [Nat]Absence check using 78 positive place invariants in 24 ms returned sat
[2021-05-09 08:23:29] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 10 ms returned sat
[2021-05-09 08:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:29] [INFO ] [Nat]Absence check using state equation in 181 ms returned unsat
[2021-05-09 08:23:30] [INFO ] [Real]Absence check using 78 positive place invariants in 25 ms returned sat
[2021-05-09 08:23:30] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2021-05-09 08:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:30] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2021-05-09 08:23:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:23:30] [INFO ] [Nat]Absence check using 78 positive place invariants in 61 ms returned sat
[2021-05-09 08:23:30] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2021-05-09 08:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:31] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 1 ms to minimize.
[2021-05-09 08:23:31] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 1 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 0 ms to minimize.
[2021-05-09 08:23:32] [INFO ] Deduced a trap composed of 182 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:23:33] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 170 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 163 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 181 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 172 places in 131 ms of which 14 ms to minimize.
[2021-05-09 08:23:34] [INFO ] Deduced a trap composed of 172 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 177 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [INFO ] Deduced a trap composed of 168 places in 171 ms of which 0 ms to minimize.
[2021-05-09 08:23:35] [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 4
[2021-05-09 08:23:35] [INFO ] [Real]Absence check using 78 positive place invariants in 24 ms returned sat
[2021-05-09 08:23:35] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 08:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:23:35] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 0 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:23:36] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 1 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 143 places in 235 ms of which 1 ms to minimize.
[2021-05-09 08:23:37] [INFO ] Deduced a trap composed of 140 places in 217 ms of which 1 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 1 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 0 ms to minimize.
[2021-05-09 08:23:38] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:23:39] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:23:40] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:23:40] [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 5
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 37800 steps, including 231 resets, run finished after 151 ms. (steps per millisecond=250 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 17 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 417 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 744 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 165 place count 744 transition count 499
Reduce places removed 163 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 166 rules applied. Total rules applied 331 place count 581 transition count 496
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 334 place count 578 transition count 496
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 334 place count 578 transition count 382
Deduced a syphon composed of 114 places in 2 ms
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 586 place count 440 transition count 382
Discarding 92 places :
Symmetric choice reduction at 3 with 92 rule applications. Total rules 678 place count 348 transition count 290
Iterating global reduction 3 with 92 rules applied. Total rules applied 770 place count 348 transition count 290
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 770 place count 348 transition count 282
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 787 place count 339 transition count 282
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 1021 place count 221 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1023 place count 220 transition count 169
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1025 place count 220 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1027 place count 218 transition count 167
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1028 place count 218 transition count 167
Applied a total of 1028 rules in 202 ms. Remains 218 /757 variables (removed 539) and now considering 167/670 (removed 503) transitions.
Finished structural reductions, in 1 iterations. Remains : 218/757 places, 167/670 transitions.
[2021-05-09 08:23:41] [INFO ] Flatten gal took : 89 ms
[2021-05-09 08:23:41] [INFO ] Flatten gal took : 35 ms
[2021-05-09 08:23:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4028074293098490029.gal : 14 ms
[2021-05-09 08:23:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16771314072609746136.prop : 4 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/ReachabilityCardinality4028074293098490029.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16771314072609746136.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/ReachabilityCardinality4028074293098490029.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16771314072609746136.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16771314072609746136.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :8 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 67
Reachability property BusinessProcesses-PT-19-ReachabilityCardinality-13 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :67 after 875
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :875 after 1465
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1465 after 8201
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :8201 after 19313
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :19313 after 821295
Reachability property BusinessProcesses-PT-19-ReachabilityCardinality-11 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-19-ReachabilityCardinality-10 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :821295 after 5.69203e+06
Detected timeout of ITS tools.
[2021-05-09 08:23:56] [INFO ] Flatten gal took : 44 ms
[2021-05-09 08:23:56] [INFO ] Applying decomposition
[2021-05-09 08:23:56] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2312077281752811792.txt, -o, /tmp/graph2312077281752811792.bin, -w, /tmp/graph2312077281752811792.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2312077281752811792.bin, -l, -1, -v, -w, /tmp/graph2312077281752811792.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:23:56] [INFO ] Decomposing Gal with order
[2021-05-09 08:23:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:23:56] [INFO ] Removed a total of 185 redundant transitions.
[2021-05-09 08:23:56] [INFO ] Flatten gal took : 71 ms
[2021-05-09 08:23:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 35 ms.
[2021-05-09 08:23:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14014272657328382380.gal : 18 ms
[2021-05-09 08:23:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8719297715015805699.prop : 0 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/ReachabilityCardinality14014272657328382380.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8719297715015805699.prop, --nowitness], 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/ReachabilityCardinality14014272657328382380.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8719297715015805699.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8719297715015805699.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 1585
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1585 after 2721
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2721 after 1.03006e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.03006e+07 after 1.13374e+07
Reachability property BusinessProcesses-PT-19-ReachabilityCardinality-15 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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\_mod\_flat,2.48158e+07,0.187443,9516,791,421,8407,2662,682,12955,183,9208,0
Total reachable state count : 24815809

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-19-ReachabilityCardinality-15 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-19-ReachabilityCardinality-15,3456,0.190013,9780,101,61,8407,2662,703,12955,191,9208,0
All properties solved without resorting to model-checking.

BK_STOP 1620548637619

--------------------
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-19"
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-19, 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-162038143900470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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