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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620544806054

Running Version 0
[2021-05-09 07:20:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:20:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:20:08] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2021-05-09 07:20:08] [INFO ] Transformed 518 places.
[2021-05-09 07:20:08] [INFO ] Transformed 471 transitions.
[2021-05-09 07:20:08] [INFO ] Found NUPN structural information;
[2021-05-09 07:20:08] [INFO ] Parsed PT model containing 518 places and 471 transitions in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :2
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 471 rows 518 cols
[2021-05-09 07:20:08] [INFO ] Computed 85 place invariants in 44 ms
[2021-05-09 07:20:08] [INFO ] [Real]Absence check using 48 positive place invariants in 19 ms returned sat
[2021-05-09 07:20:08] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-09 07:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:08] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-09 07:20:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:09] [INFO ] [Nat]Absence check using 48 positive place invariants in 28 ms returned unsat
[2021-05-09 07:20:09] [INFO ] [Real]Absence check using 48 positive place invariants in 17 ms returned sat
[2021-05-09 07:20:09] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2021-05-09 07:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:09] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-09 07:20:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:09] [INFO ] [Nat]Absence check using 48 positive place invariants in 20 ms returned sat
[2021-05-09 07:20:09] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-09 07:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:09] [INFO ] [Nat]Absence check using state equation in 118 ms returned unsat
[2021-05-09 07:20:09] [INFO ] [Real]Absence check using 48 positive place invariants in 23 ms returned sat
[2021-05-09 07:20:09] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 14 ms returned sat
[2021-05-09 07:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:10] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2021-05-09 07:20:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:10] [INFO ] [Nat]Absence check using 48 positive place invariants in 16 ms returned sat
[2021-05-09 07:20:10] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-09 07:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:10] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2021-05-09 07:20:10] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 4 ms to minimize.
[2021-05-09 07:20:10] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 2 ms to minimize.
[2021-05-09 07:20:11] [INFO ] Deduced a trap composed of 128 places in 177 ms of which 1 ms to minimize.
[2021-05-09 07:20:11] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 1 ms to minimize.
[2021-05-09 07:20:11] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2021-05-09 07:20:11] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 0 ms to minimize.
[2021-05-09 07:20:12] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 1 ms to minimize.
[2021-05-09 07:20:12] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:20:12] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:20:12] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 1 ms to minimize.
[2021-05-09 07:20:12] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2021-05-09 07:20:13] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 1 ms to minimize.
[2021-05-09 07:20:13] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 1 ms to minimize.
[2021-05-09 07:20:13] [INFO ] Deduced a trap composed of 133 places in 184 ms of which 0 ms to minimize.
[2021-05-09 07:20:13] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:20:14] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2021-05-09 07:20:14] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:20:14] [INFO ] Deduced a trap composed of 123 places in 235 ms of which 1 ms to minimize.
[2021-05-09 07:20:14] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:20:14] [INFO ] Deduced a trap composed of 112 places in 229 ms of which 0 ms to minimize.
[2021-05-09 07:20:15] [INFO ] Deduced a trap composed of 109 places in 170 ms of which 1 ms to minimize.
[2021-05-09 07:20:15] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2021-05-09 07:20:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-09 07:20:15] [INFO ] [Real]Absence check using 48 positive place invariants in 20 ms returned sat
[2021-05-09 07:20:15] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned sat
[2021-05-09 07:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:15] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2021-05-09 07:20:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:15] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned sat
[2021-05-09 07:20:15] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2021-05-09 07:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:16] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-09 07:20:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:16] [INFO ] [Real]Absence check using 48 positive place invariants in 11 ms returned unsat
[2021-05-09 07:20:16] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned sat
[2021-05-09 07:20:16] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2021-05-09 07:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:16] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-09 07:20:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:20:16] [INFO ] [Nat]Absence check using 48 positive place invariants in 14 ms returned sat
[2021-05-09 07:20:16] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 8 ms returned sat
[2021-05-09 07:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:20:16] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-09 07:20:16] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:20:17] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:20:17] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:20:17] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2021-05-09 07:20:17] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:20:17] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2021-05-09 07:20:17] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2021-05-09 07:20:18] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:20:18] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:20:18] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 5 ms to minimize.
[2021-05-09 07:20:18] [INFO ] Deduced a trap composed of 117 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:20:18] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:20:18] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 4 ms to minimize.
[2021-05-09 07:20:18] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:20:18] [INFO ] Deduced a trap composed of 123 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 118 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 122 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 122 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 115 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 116 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:20:19] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:20:20] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:20:20] [INFO ] Deduced a trap composed of 110 places in 174 ms of which 0 ms to minimize.
[2021-05-09 07:20:20] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:20:20] [INFO ] Deduced a trap composed of 114 places in 150 ms of which 0 ms to minimize.
[2021-05-09 07:20:20] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:20:20] [INFO ] Deduced a trap composed of 121 places in 155 ms of which 0 ms to minimize.
[2021-05-09 07:20:21] [INFO ] Deduced a trap composed of 118 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:20:21] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:20:21] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:20:21] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:20:21] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:20: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 6
[2021-05-09 07:20:21] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned sat
[2021-05-09 07:20:21] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 6 ms returned unsat
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 288 edges and 518 vertex of which 7 / 518 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 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 510 transition count 353
Reduce places removed 109 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 401 transition count 351
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 224 place count 399 transition count 351
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 224 place count 399 transition count 277
Deduced a syphon composed of 74 places in 3 ms
Ensure Unique test removed 10 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 382 place count 315 transition count 277
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 446 place count 251 transition count 213
Iterating global reduction 3 with 64 rules applied. Total rules applied 510 place count 251 transition count 213
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 510 place count 251 transition count 205
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 528 place count 241 transition count 205
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 691 place count 158 transition count 125
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 693 place count 157 transition count 128
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 695 place count 157 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 697 place count 155 transition count 126
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 698 place count 155 transition count 126
Applied a total of 698 rules in 159 ms. Remains 155 /518 variables (removed 363) and now considering 126/471 (removed 345) transitions.
Finished structural reductions, in 1 iterations. Remains : 155/518 places, 126/471 transitions.
[2021-05-09 07:20:22] [INFO ] Flatten gal took : 72 ms
[2021-05-09 07:20:22] [INFO ] Flatten gal took : 24 ms
[2021-05-09 07:20:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11119408639103258603.gal : 49 ms
[2021-05-09 07:20:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14163205608443863471.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/ReachabilityCardinality11119408639103258603.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14163205608443863471.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/ReachabilityCardinality11119408639103258603.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14163205608443863471.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14163205608443863471.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 21
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :21 after 55
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :55 after 109
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-12 does not hold.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-03 does not hold.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 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 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,1809,0.189345,9632,2,3706,12,17663,6,0,746,8543,0
Total reachable state count : 1809

Verifying 2 reachability properties.
Invariant property BusinessProcesses-PT-10-ReachabilityCardinality-03 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-10-ReachabilityCardinality-03,1,0.190928,9896,2,156,12,17663,7,0,759,8543,0
Invariant property BusinessProcesses-PT-10-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-10-ReachabilityCardinality-12,1,0.191843,9896,2,156,12,17663,8,0,761,8543,0
All properties solved without resorting to model-checking.

BK_STOP 1620544822952

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

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