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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K 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 81K 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.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.1K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 161K 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-17-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620548314215

Running Version 0
[2021-05-09 08:18:36] [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:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:18:36] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-09 08:18:36] [INFO ] Transformed 650 places.
[2021-05-09 08:18:36] [INFO ] Transformed 580 transitions.
[2021-05-09 08:18:36] [INFO ] Found NUPN structural information;
[2021-05-09 08:18:36] [INFO ] Parsed PT model containing 650 places and 580 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 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 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 576 rows 646 cols
[2021-05-09 08:18:36] [INFO ] Computed 108 place invariants in 43 ms
[2021-05-09 08:18:36] [INFO ] [Real]Absence check using 62 positive place invariants in 33 ms returned sat
[2021-05-09 08:18:36] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 15 ms returned sat
[2021-05-09 08:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:37] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2021-05-09 08:18:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:37] [INFO ] [Nat]Absence check using 62 positive place invariants in 38 ms returned sat
[2021-05-09 08:18:37] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:37] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-09 08:18:37] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 4 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:18:38] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2021-05-09 08:18:39] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 1 ms to minimize.
[2021-05-09 08:18:40] [INFO ] Deduced a trap composed of 126 places in 201 ms of which 1 ms to minimize.
[2021-05-09 08:18:40] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 0 ms to minimize.
[2021-05-09 08:18:40] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 1 ms to minimize.
[2021-05-09 08:18:40] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:18:40] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:18:41] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 0 ms to minimize.
[2021-05-09 08:18:41] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:18:41] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:18:41] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:18:41] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:18:42] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 1 ms to minimize.
[2021-05-09 08:18:42] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:18:42] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:18:42] [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 0
[2021-05-09 08:18:42] [INFO ] [Real]Absence check using 62 positive place invariants in 31 ms returned sat
[2021-05-09 08:18:42] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:42] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2021-05-09 08:18:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:43] [INFO ] [Nat]Absence check using 62 positive place invariants in 43 ms returned sat
[2021-05-09 08:18:43] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:18:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:43] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2021-05-09 08:18:43] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 0 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 0 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:18:44] [INFO ] Deduced a trap composed of 132 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 1 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:18:45] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 1 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 5 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 1 ms to minimize.
[2021-05-09 08:18:46] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 1 ms to minimize.
[2021-05-09 08:18:47] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 1 ms to minimize.
[2021-05-09 08:18:47] [INFO ] Deduced a trap composed of 56 places in 245 ms of which 0 ms to minimize.
[2021-05-09 08:18:47] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 1 ms to minimize.
[2021-05-09 08:18:47] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:18:48] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2021-05-09 08:18:48] [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:18:48] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2021-05-09 08:18:48] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2021-05-09 08:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:48] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2021-05-09 08:18:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:49] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2021-05-09 08:18:49] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2021-05-09 08:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:49] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 122 places in 177 ms of which 0 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
[2021-05-09 08:18:49] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:18:50] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 1 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:18:51] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:18:52] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:18:52] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2819 ms
[2021-05-09 08:18:52] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 69 ms.
[2021-05-09 08:18:53] [INFO ] Added : 280 causal constraints over 56 iterations in 1821 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-09 08:18:54] [INFO ] [Real]Absence check using 62 positive place invariants in 43 ms returned sat
[2021-05-09 08:18:54] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:54] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-09 08:18:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:18:54] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:18:54] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:54] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 4 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 3 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:18:55] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 2 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 150 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:18:56] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 0 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 134 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:18:57] [INFO ] Deduced a trap composed of 159 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 1 ms to minimize.
[2021-05-09 08:18:58] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 0 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 0 ms to minimize.
[2021-05-09 08:18:59] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 1 ms to minimize.
[2021-05-09 08:18:59] [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 3
[2021-05-09 08:18:59] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:18:59] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:18:59] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-09 08:18:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:00] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:19:00] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:00] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2021-05-09 08:19:00] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:19:00] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 12 ms to minimize.
[2021-05-09 08:19:00] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:19:01] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:19:01] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:19:01] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:19:01] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:19:01] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2021-05-09 08:19:01] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:19:01] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:19:02] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 147 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:19:03] [INFO ] Deduced a trap composed of 149 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 175 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 155 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 153 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:19:04] [INFO ] Deduced a trap composed of 143 places in 121 ms of which 1 ms to minimize.
[2021-05-09 08:19:05] [INFO ] Deduced a trap composed of 148 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:19:05] [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:19:05] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2021-05-09 08:19:05] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:05] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-09 08:19:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:05] [INFO ] [Real]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:19:05] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 17 ms returned sat
[2021-05-09 08:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:06] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2021-05-09 08:19:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:19:06] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:19:06] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:19:06] [INFO ] [Nat]Absence check using state equation in 205 ms returned unsat
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 350 edges and 646 vertex of which 7 / 646 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 636 transition count 435
Reduce places removed 132 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 137 rules applied. Total rules applied 271 place count 504 transition count 430
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 276 place count 499 transition count 430
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 276 place count 499 transition count 340
Deduced a syphon composed of 90 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 473 place count 392 transition count 340
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 548 place count 317 transition count 265
Iterating global reduction 3 with 75 rules applied. Total rules applied 623 place count 317 transition count 265
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 623 place count 317 transition count 259
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 637 place count 309 transition count 259
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 829 place count 213 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 831 place count 212 transition count 167
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 833 place count 212 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 835 place count 210 transition count 165
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 840 place count 210 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 841 place count 209 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 842 place count 208 transition count 164
Applied a total of 842 rules in 229 ms. Remains 208 /646 variables (removed 438) and now considering 164/576 (removed 412) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/646 places, 164/576 transitions.
[2021-05-09 08:19:06] [INFO ] Flatten gal took : 91 ms
[2021-05-09 08:19:06] [INFO ] Flatten gal took : 24 ms
[2021-05-09 08:19:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9413589028618888093.gal : 15 ms
[2021-05-09 08:19:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17032850713429550863.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/ReachabilityCardinality9413589028618888093.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17032850713429550863.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/ReachabilityCardinality9413589028618888093.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17032850713429550863.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17032850713429550863.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 24
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :24 after 28
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :28 after 38
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :38 after 72
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :72 after 310
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2380 after 5218
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-12 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5218 after 29914
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-06 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-02 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :29914 after 42900
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-07 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-01 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,47594,0.630741,21228,2,8370,21,57254,6,0,994,22377,0
Total reachable state count : 47594

Verifying 5 reachability properties.
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-01 does not hold.

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-17-ReachabilityCardinality-01,120,0.673439,21228,2,350,21,57254,7,0,1012,22377,0
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-02 does not hold.

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-17-ReachabilityCardinality-02,1,0.6755,21492,2,209,21,57254,8,0,1028,22377,0
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-06 does not hold.

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-17-ReachabilityCardinality-06,60,0.687077,21492,2,361,21,57254,9,0,1052,22377,0
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-07 does not hold.

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-17-ReachabilityCardinality-07,1,0.688703,21492,2,209,21,57254,10,0,1057,22377,0
Invariant property BusinessProcesses-PT-17-ReachabilityCardinality-12 does not hold.

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-17-ReachabilityCardinality-12,30,0.689148,21492,2,284,21,57254,11,0,1062,22377,0
All properties solved without resorting to model-checking.

BK_STOP 1620548348194

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

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