Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500390.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 30 00:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 00:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 30 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 104K May 10 09:33 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-09-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200560872

Running Version 202205111006
[2022-06-02 20:09:22] [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]
[2022-06-02 20:09:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:09:22] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-06-02 20:09:22] [INFO ] Transformed 403 places.
[2022-06-02 20:09:22] [INFO ] Transformed 374 transitions.
[2022-06-02 20:09:22] [INFO ] Found NUPN structural information;
[2022-06-02 20:09:22] [INFO ] Parsed PT model containing 403 places and 374 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 108 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 14) seen :5
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 374 rows 403 cols
[2022-06-02 20:09:23] [INFO ] Computed 65 place invariants in 26 ms
[2022-06-02 20:09:23] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-02 20:09:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-06-02 20:09:24] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-02 20:09:24] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2022-06-02 20:09:24] [INFO ] Deduced a trap composed of 8 places in 318 ms of which 107 ms to minimize.
[2022-06-02 20:09:24] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 1 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 0 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 1 ms to minimize.
[2022-06-02 20:09:25] [INFO ] Deduced a trap composed of 108 places in 94 ms of which 1 ms to minimize.
[2022-06-02 20:09:26] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2022-06-02 20:09:26] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 0 ms to minimize.
[2022-06-02 20:09:26] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 3 ms to minimize.
[2022-06-02 20:09:26] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 9 ms to minimize.
[2022-06-02 20:09:26] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 0 ms to minimize.
[2022-06-02 20:09:26] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 1 ms to minimize.
[2022-06-02 20:09:26] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 1 ms to minimize.
[2022-06-02 20:09:27] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 0 ms to minimize.
[2022-06-02 20:09:27] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 0 ms to minimize.
[2022-06-02 20:09:27] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 1 ms to minimize.
[2022-06-02 20:09:27] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 1 ms to minimize.
[2022-06-02 20:09:27] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:09:27] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:09:27] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:09:28] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:09:28] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2022-06-02 20:09:28] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:09:28] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2022-06-02 20:09:28] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2022-06-02 20:09:28] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:09:28] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:09:28] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 1 ms to minimize.
[2022-06-02 20:09:29] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:09:29] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 5 ms to minimize.
[2022-06-02 20:09:29] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 0 ms to minimize.
[2022-06-02 20:09:29] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 1 ms to minimize.
[2022-06-02 20:09:29] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 1 ms to minimize.
[2022-06-02 20:09:29] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 0 ms to minimize.
[2022-06-02 20:09:29] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 1 ms to minimize.
[2022-06-02 20:09:30] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 0 ms to minimize.
[2022-06-02 20:09:30] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2022-06-02 20:09:30] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2022-06-02 20:09:30] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2022-06-02 20:09:30] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2022-06-02 20:09:30] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 0 ms to minimize.
[2022-06-02 20:09:30] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 0 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 6804 ms
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 0 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 0 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 0 ms to minimize.
[2022-06-02 20:09:31] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 4 ms to minimize.
[2022-06-02 20:09:32] [INFO ] Deduced a trap composed of 103 places in 83 ms of which 1 ms to minimize.
[2022-06-02 20:09:32] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 0 ms to minimize.
[2022-06-02 20:09:32] [INFO ] Deduced a trap composed of 102 places in 81 ms of which 0 ms to minimize.
[2022-06-02 20:09:32] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 0 ms to minimize.
[2022-06-02 20:09:32] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-06-02 20:09:32] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 0 ms to minimize.
[2022-06-02 20:09:32] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 0 ms to minimize.
[2022-06-02 20:09:32] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 0 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 3 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 105 places in 77 ms of which 1 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:09:34] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 1 ms to minimize.
[2022-06-02 20:09:34] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 0 ms to minimize.
[2022-06-02 20:09:34] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2022-06-02 20:09:34] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:09:34] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2022-06-02 20:09:34] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2022-06-02 20:09:34] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:09:34] [INFO ] Deduced a trap composed of 111 places in 81 ms of which 0 ms to minimize.
[2022-06-02 20:09:35] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 1 ms to minimize.
[2022-06-02 20:09:35] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2022-06-02 20:09:35] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 0 ms to minimize.
[2022-06-02 20:09:35] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 1 ms to minimize.
[2022-06-02 20:09:35] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 0 ms to minimize.
[2022-06-02 20:09:35] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 0 ms to minimize.
[2022-06-02 20:09:35] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-06-02 20:09:35] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2022-06-02 20:09:36] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2022-06-02 20:09:36] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2022-06-02 20:09:36] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 0 ms to minimize.
[2022-06-02 20:09:36] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 1 ms to minimize.
[2022-06-02 20:09:37] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-06-02 20:09:37] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2022-06-02 20:09:37] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2022-06-02 20:09:37] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2022-06-02 20:09:37] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 5962 ms
[2022-06-02 20:09:37] [INFO ] After 13177ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 257 ms.
[2022-06-02 20:09:37] [INFO ] After 13592ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 667 ms.
Support contains 25 out of 403 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 196 edges and 403 vertex of which 4 / 403 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 841 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 398 transition count 297
Reduce places removed 72 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 79 rules applied. Total rules applied 153 place count 326 transition count 290
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 160 place count 319 transition count 290
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 160 place count 319 transition count 240
Deduced a syphon composed of 50 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 270 place count 259 transition count 240
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 309 place count 220 transition count 201
Iterating global reduction 3 with 39 rules applied. Total rules applied 348 place count 220 transition count 201
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 348 place count 220 transition count 196
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 359 place count 214 transition count 196
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 479 place count 153 transition count 137
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 481 place count 152 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 483 place count 152 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 485 place count 150 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 486 place count 150 transition count 138
Applied a total of 486 rules in 128 ms. Remains 150 /403 variables (removed 253) and now considering 138/374 (removed 236) transitions.
Finished structural reductions, in 1 iterations. Remains : 150/403 places, 138/374 transitions.
Incomplete random walk after 1000000 steps, including 49539 resets, run finished after 2058 ms. (steps per millisecond=485 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 12383 resets, run finished after 1127 ms. (steps per millisecond=887 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 138 rows 150 cols
[2022-06-02 20:09:41] [INFO ] Computed 51 place invariants in 9 ms
[2022-06-02 20:09:41] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:09:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2022-06-02 20:09:41] [INFO ] [Nat]Absence check using 33 positive and 18 generalized place invariants in 4 ms returned sat
[2022-06-02 20:09:41] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-02 20:09:41] [INFO ] After 29ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:41] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2022-06-02 20:09:41] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2022-06-02 20:09:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2022-06-02 20:09:41] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-02 20:09:41] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 13 out of 150 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 138/138 transitions.
Graph (trivial) has 14 edges and 150 vertex of which 3 / 150 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 148 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 147 transition count 134
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3 place count 147 transition count 127
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 140 transition count 127
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 136 transition count 123
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 136 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 135 transition count 122
Applied a total of 27 rules in 21 ms. Remains 135 /150 variables (removed 15) and now considering 122/138 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/150 places, 122/138 transitions.
Incomplete random walk after 1000000 steps, including 41764 resets, run finished after 2106 ms. (steps per millisecond=474 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14258 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1461413 steps, run visited all 1 properties in 2795 ms. (steps per millisecond=522 )
Probabilistic random walk after 1461413 steps, saw 368203 distinct states, run finished after 2795 ms. (steps per millisecond=522 ) properties seen :1
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 25986 ms.

BK_STOP 1654200588145

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-09"
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-09, 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 r024-tall-165251918500390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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