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-165251918500414.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-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500414
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 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 146K 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-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200642748

Running Version 202205111006
[2022-06-02 20:10:43] [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:10:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:10:44] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2022-06-02 20:10:44] [INFO ] Transformed 586 places.
[2022-06-02 20:10:44] [INFO ] Transformed 525 transitions.
[2022-06-02 20:10:44] [INFO ] Found NUPN structural information;
[2022-06-02 20:10:44] [INFO ] Parsed PT model containing 586 places and 525 transitions in 234 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 73 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 15) seen :2
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 521 rows 582 cols
[2022-06-02 20:10:45] [INFO ] Computed 98 place invariants in 27 ms
[2022-06-02 20:10:46] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-02 20:10:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2022-06-02 20:10:46] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2022-06-02 20:10:47] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :5
[2022-06-02 20:10:47] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 6 ms to minimize.
[2022-06-02 20:10:47] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 2 ms to minimize.
[2022-06-02 20:10:47] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2022-06-02 20:10:47] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:10:47] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:10:48] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:10:48] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:10:48] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:10:48] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:10:48] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:10:48] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2022-06-02 20:10:49] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:10:50] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:10:50] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:10:50] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:50] [INFO ] Deduced a trap composed of 141 places in 127 ms of which 2 ms to minimize.
[2022-06-02 20:10:50] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:10:50] [INFO ] Deduced a trap composed of 127 places in 135 ms of which 0 ms to minimize.
[2022-06-02 20:10:51] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:10:51] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:10:51] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:10:51] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:10:51] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:10:51] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:10:51] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:10:52] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:10:52] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 1 ms to minimize.
[2022-06-02 20:10:52] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:10:52] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:10:52] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 0 ms to minimize.
[2022-06-02 20:10:52] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:10:53] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:10:53] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:10:53] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:10:53] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:10:53] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:10:53] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:10:54] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:10:54] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:10:54] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:10:54] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:10:54] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:10:54] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:10:54] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:10:55] [INFO ] Deduced a trap composed of 135 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:10:55] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:10:55] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:10:55] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:10:55] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 3 ms to minimize.
[2022-06-02 20:10:55] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:10:55] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:10:56] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:10:56] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:10:56] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:10:56] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:10:56] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 9591 ms
[2022-06-02 20:10:56] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2022-06-02 20:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-06-02 20:10:57] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:10:57] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:10:57] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:10:57] [INFO ] Deduced a trap composed of 142 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:10:57] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:10:57] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:10:58] [INFO ] Deduced a trap composed of 127 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:10:58] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:58] [INFO ] Deduced a trap composed of 121 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:10:58] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:10:58] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:10:58] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:10:59] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:10:59] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:10:59] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:10:59] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:10:59] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2022-06-02 20:10:59] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:11:00] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:11:00] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:11:00] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3329 ms
[2022-06-02 20:11:00] [INFO ] After 13987ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :5
Attempting to minimize the solution found.
Minimization took 402 ms.
[2022-06-02 20:11:00] [INFO ] After 14666ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :5
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 5 different solutions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2958 ms.
Support contains 36 out of 582 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 291 edges and 582 vertex of which 4 / 582 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1182 edges and 579 vertex of which 575 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 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 575 transition count 407
Reduce places removed 109 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 117 rules applied. Total rules applied 228 place count 466 transition count 399
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 236 place count 458 transition count 399
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 236 place count 458 transition count 320
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 407 place count 366 transition count 320
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 469 place count 304 transition count 258
Iterating global reduction 3 with 62 rules applied. Total rules applied 531 place count 304 transition count 258
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 531 place count 304 transition count 253
Deduced a syphon composed of 5 places in 2 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 542 place count 298 transition count 253
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 165 rules applied. Total rules applied 707 place count 214 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 709 place count 213 transition count 176
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 712 place count 213 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 715 place count 210 transition count 173
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 716 place count 210 transition count 173
Applied a total of 716 rules in 142 ms. Remains 210 /582 variables (removed 372) and now considering 173/521 (removed 348) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/582 places, 173/521 transitions.
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 10259 ms. (steps per millisecond=97 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 678491 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen 0
Interrupted Best-First random walk after 653021 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 173 rows 210 cols
[2022-06-02 20:11:24] [INFO ] Computed 78 place invariants in 4 ms
[2022-06-02 20:11:24] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 20:11:24] [INFO ] [Nat]Absence check using 51 positive place invariants in 19 ms returned sat
[2022-06-02 20:11:24] [INFO ] [Nat]Absence check using 51 positive and 27 generalized place invariants in 6 ms returned sat
[2022-06-02 20:11:24] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 20:11:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-06-02 20:11:24] [INFO ] After 26ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2022-06-02 20:11:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 156 ms
[2022-06-02 20:11:24] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-02 20:11:24] [INFO ] After 538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 66 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=33 )
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 40936 ms.

BK_STOP 1654200684919

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

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