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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 15K 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 192K 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-20-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620548848286

Running Version 0
[2021-05-09 08:27:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:27:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:27:30] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2021-05-09 08:27:30] [INFO ] Transformed 782 places.
[2021-05-09 08:27:30] [INFO ] Transformed 697 transitions.
[2021-05-09 08:27:30] [INFO ] Found NUPN structural information;
[2021-05-09 08:27:30] [INFO ] Parsed PT model containing 782 places and 697 transitions in 136 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 16 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 49 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :6
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 638 rows 719 cols
[2021-05-09 08:27:30] [INFO ] Computed 121 place invariants in 42 ms
[2021-05-09 08:27:30] [INFO ] [Real]Absence check using 78 positive place invariants in 39 ms returned sat
[2021-05-09 08:27:30] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-09 08:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:30] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-09 08:27:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:31] [INFO ] [Nat]Absence check using 78 positive place invariants in 30 ms returned sat
[2021-05-09 08:27:31] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 08:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:31] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 4 ms to minimize.
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 2 ms to minimize.
[2021-05-09 08:27:31] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 157 places in 201 ms of which 2 ms to minimize.
[2021-05-09 08:27:32] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 0 ms to minimize.
[2021-05-09 08:27:33] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:27:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1774 ms
[2021-05-09 08:27:33] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 50 ms.
[2021-05-09 08:27:35] [INFO ] Added : 290 causal constraints over 58 iterations in 2875 ms. Result :unknown
[2021-05-09 08:27:36] [INFO ] [Real]Absence check using 78 positive place invariants in 40 ms returned sat
[2021-05-09 08:27:36] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 08:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:36] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2021-05-09 08:27:36] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2021-05-09 08:27:36] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:27:37] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 1 ms to minimize.
[2021-05-09 08:27:37] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 0 ms to minimize.
[2021-05-09 08:27:37] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 1 ms to minimize.
[2021-05-09 08:27:37] [INFO ] Deduced a trap composed of 149 places in 200 ms of which 1 ms to minimize.
[2021-05-09 08:27:38] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 1 ms to minimize.
[2021-05-09 08:27:38] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:27:38] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:27:38] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 1 ms to minimize.
[2021-05-09 08:27:39] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 1 ms to minimize.
[2021-05-09 08:27:39] [INFO ] Deduced a trap composed of 150 places in 203 ms of which 1 ms to minimize.
[2021-05-09 08:27:39] [INFO ] Deduced a trap composed of 59 places in 282 ms of which 14 ms to minimize.
[2021-05-09 08:27:39] [INFO ] Deduced a trap composed of 154 places in 240 ms of which 0 ms to minimize.
[2021-05-09 08:27:40] [INFO ] Deduced a trap composed of 131 places in 239 ms of which 1 ms to minimize.
[2021-05-09 08:27:40] [INFO ] Deduced a trap composed of 127 places in 209 ms of which 1 ms to minimize.
[2021-05-09 08:27:40] [INFO ] Deduced a trap composed of 157 places in 228 ms of which 1 ms to minimize.
[2021-05-09 08:27:40] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:27:40] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:27:41] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:27:41] [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:27:41] [INFO ] [Real]Absence check using 78 positive place invariants in 13 ms returned unsat
[2021-05-09 08:27:41] [INFO ] [Real]Absence check using 78 positive place invariants in 40 ms returned sat
[2021-05-09 08:27:41] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 21 ms returned sat
[2021-05-09 08:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:42] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2021-05-09 08:27:42] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:27:42] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2021-05-09 08:27:42] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 0 ms to minimize.
[2021-05-09 08:27:42] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:27:42] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2021-05-09 08:27:43] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 6 ms to minimize.
[2021-05-09 08:27:43] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:27:43] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2021-05-09 08:27:43] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:27:43] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:27:44] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:27:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2115 ms
[2021-05-09 08:27:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:44] [INFO ] [Nat]Absence check using 78 positive place invariants in 42 ms returned sat
[2021-05-09 08:27:44] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 33 ms returned sat
[2021-05-09 08:27:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:45] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2021-05-09 08:27:45] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:27:45] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:27:45] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:27:45] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:27:46] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:27:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1007 ms
[2021-05-09 08:27:46] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 59 ms.
[2021-05-09 08:27:49] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 2 ms to minimize.
[2021-05-09 08:27:49] [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:27:49] [INFO ] [Real]Absence check using 78 positive place invariants in 25 ms returned sat
[2021-05-09 08:27:49] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-09 08:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:49] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-09 08:27:50] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2021-05-09 08:27:50] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:27:50] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:27:50] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:27:50] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:27:50] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:27:51] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:27:51] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:27:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1495 ms
[2021-05-09 08:27:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:51] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2021-05-09 08:27:51] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-09 08:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:51] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-09 08:27:51] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:27:52] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:27:52] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 8 ms to minimize.
[2021-05-09 08:27:52] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:27:52] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 0 ms to minimize.
[2021-05-09 08:27:52] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2021-05-09 08:27:53] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2021-05-09 08:27:53] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:27:53] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:27:53] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:27:53] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:27:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1942 ms
[2021-05-09 08:27:53] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 45 ms.
[2021-05-09 08:27:56] [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:27:56] [INFO ] [Real]Absence check using 78 positive place invariants in 42 ms returned sat
[2021-05-09 08:27:56] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 22 ms returned sat
[2021-05-09 08:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:57] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2021-05-09 08:27:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:27:57] [INFO ] [Nat]Absence check using 78 positive place invariants in 30 ms returned sat
[2021-05-09 08:27:57] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2021-05-09 08:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:27:58] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2021-05-09 08:27:58] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 13 ms to minimize.
[2021-05-09 08:27:58] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2021-05-09 08:27:58] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 11 ms to minimize.
[2021-05-09 08:27:58] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2021-05-09 08:27:59] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:27:59] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:27:59] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:27:59] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:27:59] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:28:00] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 1 ms to minimize.
[2021-05-09 08:28:00] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:28:00] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:28:00] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:28:00] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 1 ms to minimize.
[2021-05-09 08:28:00] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:28:00] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:28:01] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:28:01] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:28:01] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:28:01] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:28:01] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:28:01] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 0 ms to minimize.
[2021-05-09 08:28:02] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2021-05-09 08:28:02] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:28:02] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:28:02] [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-20-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 36100 steps, including 368 resets, run finished after 148 ms. (steps per millisecond=243 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 28 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 692 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.6 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 692 transition count 519
Reduce places removed 106 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 113 rules applied. Total rules applied 220 place count 586 transition count 512
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 227 place count 579 transition count 512
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 145 Pre rules applied. Total rules applied 227 place count 579 transition count 367
Deduced a syphon composed of 145 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 537 place count 414 transition count 367
Discarding 84 places :
Symmetric choice reduction at 3 with 84 rule applications. Total rules 621 place count 330 transition count 283
Iterating global reduction 3 with 84 rules applied. Total rules applied 705 place count 330 transition count 283
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 705 place count 330 transition count 276
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 721 place count 321 transition count 276
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 919 place count 222 transition count 177
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 921 place count 221 transition count 180
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 925 place count 221 transition count 180
Applied a total of 925 rules in 166 ms. Remains 221 /719 variables (removed 498) and now considering 180/638 (removed 458) transitions.
Finished structural reductions, in 1 iterations. Remains : 221/719 places, 180/638 transitions.
[2021-05-09 08:28:02] [INFO ] Flatten gal took : 64 ms
[2021-05-09 08:28:02] [INFO ] Flatten gal took : 25 ms
[2021-05-09 08:28:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4629801185112522192.gal : 14 ms
[2021-05-09 08:28:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1102640546020922413.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/ReachabilityCardinality4629801185112522192.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1102640546020922413.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/ReachabilityCardinality4629801185112522192.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1102640546020922413.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1102640546020922413.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :22 after 107
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :107 after 514
Invariant property BusinessProcesses-PT-20-ReachabilityFireability-15 does not hold.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :514 after 2035
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2035 after 4627
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4627 after 17371
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :17371 after 310591
Reachability property BusinessProcesses-PT-20-ReachabilityFireability-12 is true.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-20-ReachabilityFireability-10 is true.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :310591 after 1.45695e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.45695e+08 after 3.37005e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.37005e+08 after 3.39267e+09
Reachability property BusinessProcesses-PT-20-ReachabilityFireability-05 is true.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.39267e+09 after 2.51114e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.51114e+10 after 3.32563e+11
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,1.49453e+13,3.26108,98352,2,19107,24,313265,7,0,1068,322795,0
Total reachable state count : 14945346777499

Verifying 5 reachability properties.
Invariant property BusinessProcesses-PT-20-ReachabilityFireability-04 does not hold.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-04 FALSE 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-20-ReachabilityFireability-04,24,3.27088,98352,2,298,24,313265,7,0,1073,322795,0
Reachability property BusinessProcesses-PT-20-ReachabilityFireability-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-20-ReachabilityFireability-05,2.68115e+10,3.27243,98352,2,3034,24,313265,8,0,1075,322795,0
Reachability property BusinessProcesses-PT-20-ReachabilityFireability-10 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-20-ReachabilityFireability-10,2.15654e+06,3.28192,98352,2,594,24,313265,9,0,1107,322795,0
Reachability property BusinessProcesses-PT-20-ReachabilityFireability-12 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-20-ReachabilityFireability-12,4.31309e+06,3.28253,98352,2,732,24,313265,10,0,1109,322795,0
Invariant property BusinessProcesses-PT-20-ReachabilityFireability-15 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-20-ReachabilityFireability-15,165888,3.28632,98352,2,417,24,313265,11,0,1141,322795,0
All properties solved without resorting to model-checking.

BK_STOP 1620548886469

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-20"
export BK_EXAMINATION="ReachabilityFireability"
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-20, examination is ReachabilityFireability"
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-162038143900479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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