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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 6.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:01 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.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 100K 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-07-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654200521570

Running Version 202205111006
[2022-06-02 20:08:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 20:08:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:08:43] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2022-06-02 20:08:43] [INFO ] Transformed 386 places.
[2022-06-02 20:08:43] [INFO ] Transformed 360 transitions.
[2022-06-02 20:08:43] [INFO ] Found NUPN structural information;
[2022-06-02 20:08:43] [INFO ] Parsed PT model containing 386 places and 360 transitions in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 112 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :2
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 360 rows 386 cols
[2022-06-02 20:08:44] [INFO ] Computed 62 place invariants in 26 ms
[2022-06-02 20:08:44] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 20:08:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-06-02 20:08:45] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 15 ms returned sat
[2022-06-02 20:08:45] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 4 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 21 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2022-06-02 20:08:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 895 ms
[2022-06-02 20:08:47] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 3 ms to minimize.
[2022-06-02 20:08:47] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:08:47] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2022-06-02 20:08:47] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:08:47] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:08:47] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 0 ms to minimize.
[2022-06-02 20:08:47] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 1 ms to minimize.
[2022-06-02 20:08:47] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 1 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 1 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 1 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 1 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 0 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 1 ms to minimize.
[2022-06-02 20:08:48] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2022-06-02 20:08:49] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2022-06-02 20:08:49] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 0 ms to minimize.
[2022-06-02 20:08:49] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2083 ms
[2022-06-02 20:08:49] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2022-06-02 20:08:49] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-06-02 20:08:49] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-06-02 20:08:49] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2022-06-02 20:08:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2022-06-02 20:08:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 476 ms
[2022-06-02 20:08:49] [INFO ] After 4522ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 657 ms.
[2022-06-02 20:08:50] [INFO ] After 5670ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1186 ms.
Support contains 141 out of 386 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (complete) has 813 edges and 386 vertex of which 384 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 384 transition count 344
Reduce places removed 15 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 22 rules applied. Total rules applied 38 place count 369 transition count 337
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 45 place count 362 transition count 337
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 45 place count 362 transition count 289
Deduced a syphon composed of 48 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 142 place count 313 transition count 289
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 171 place count 284 transition count 260
Iterating global reduction 3 with 29 rules applied. Total rules applied 200 place count 284 transition count 260
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 234 place count 267 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 266 transition count 245
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 266 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 265 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 264 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 263 transition count 243
Applied a total of 240 rules in 119 ms. Remains 263 /386 variables (removed 123) and now considering 243/360 (removed 117) transitions.
Finished structural reductions, in 1 iterations. Remains : 263/386 places, 243/360 transitions.
Incomplete random walk after 1000000 steps, including 16031 resets, run finished after 7351 ms. (steps per millisecond=136 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3336 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2226 resets, run finished after 2066 ms. (steps per millisecond=484 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 243 rows 263 cols
[2022-06-02 20:09:02] [INFO ] Computed 59 place invariants in 16 ms
[2022-06-02 20:09:02] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:09:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2022-06-02 20:09:02] [INFO ] [Nat]Absence check using 31 positive and 28 generalized place invariants in 13 ms returned sat
[2022-06-02 20:09:02] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 20:09:02] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
[2022-06-02 20:09:02] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2022-06-02 20:09:02] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2022-06-02 20:09:03] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2022-06-02 20:09:03] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-06-02 20:09:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2022-06-02 20:09:03] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2022-06-02 20:09:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2022-06-02 20:09:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 504 ms
[2022-06-02 20:09:03] [INFO ] After 658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-06-02 20:09:03] [INFO ] After 985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 50 out of 263 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 263/263 places, 243/243 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 263 transition count 232
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 24 place count 252 transition count 230
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 250 transition count 230
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 26 place count 250 transition count 203
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 86 place count 217 transition count 203
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 99 place count 204 transition count 189
Iterating global reduction 3 with 13 rules applied. Total rules applied 112 place count 204 transition count 189
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 174 place count 173 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
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 176 place count 172 transition count 159
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 177 place count 172 transition count 158
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 172 transition count 158
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 170 transition count 156
Applied a total of 181 rules in 47 ms. Remains 170 /263 variables (removed 93) and now considering 156/243 (removed 87) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/263 places, 156/243 transitions.
Incomplete random walk after 1000000 steps, including 36186 resets, run finished after 1917 ms. (steps per millisecond=521 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5977 resets, run finished after 2302 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 7565992 steps, run timeout after 12001 ms. (steps per millisecond=630 ) properties seen :{}
Probabilistic random walk after 7565992 steps, saw 1065917 distinct states, run finished after 12005 ms. (steps per millisecond=630 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 156 rows 170 cols
[2022-06-02 20:09:19] [INFO ] Computed 53 place invariants in 8 ms
[2022-06-02 20:09:19] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:09:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2022-06-02 20:09:19] [INFO ] [Nat]Absence check using 33 positive and 20 generalized place invariants in 5 ms returned sat
[2022-06-02 20:09:19] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:09:19] [INFO ] After 58ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:20] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2022-06-02 20:09:20] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2022-06-02 20:09:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2022-06-02 20:09:20] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-06-02 20:09:20] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 50 out of 170 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 156/156 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 170/170 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 170 cols
[2022-06-02 20:09:20] [INFO ] Computed 53 place invariants in 7 ms
[2022-06-02 20:09:20] [INFO ] Implicit Places using invariants in 117 ms returned [4, 36, 48, 50, 52, 54, 66, 67, 145, 147]
Discarding 10 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 134 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 160/170 places, 155/156 transitions.
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 160 transition count 155
Applied a total of 5 rules in 11 ms. Remains 160 /160 variables (removed 0) and now considering 155/155 (removed 0) transitions.
// Phase 1: matrix 155 rows 160 cols
[2022-06-02 20:09:20] [INFO ] Computed 44 place invariants in 2 ms
[2022-06-02 20:09:20] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 155 rows 160 cols
[2022-06-02 20:09:20] [INFO ] Computed 44 place invariants in 2 ms
[2022-06-02 20:09:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:09:20] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [92, 93, 103, 105]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 253 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 156/170 places, 155/156 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 155 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 153 transition count 152
Applied a total of 6 rules in 14 ms. Remains 153 /156 variables (removed 3) and now considering 152/155 (removed 3) transitions.
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:20] [INFO ] Computed 40 place invariants in 2 ms
[2022-06-02 20:09:20] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:20] [INFO ] Computed 40 place invariants in 5 ms
[2022-06-02 20:09:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:09:20] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 153/170 places, 152/156 transitions.
Finished structural reductions, in 3 iterations. Remains : 153/170 places, 152/156 transitions.
Incomplete random walk after 1000000 steps, including 35754 resets, run finished after 1728 ms. (steps per millisecond=578 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5932 resets, run finished after 2043 ms. (steps per millisecond=489 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6039213 steps, run timeout after 9001 ms. (steps per millisecond=670 ) properties seen :{}
Probabilistic random walk after 6039213 steps, saw 1069037 distinct states, run finished after 9001 ms. (steps per millisecond=670 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:33] [INFO ] Computed 40 place invariants in 5 ms
[2022-06-02 20:09:33] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:09:33] [INFO ] [Nat]Absence check using 24 positive place invariants in 2 ms returned sat
[2022-06-02 20:09:33] [INFO ] [Nat]Absence check using 24 positive and 16 generalized place invariants in 4 ms returned sat
[2022-06-02 20:09:33] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:09:33] [INFO ] After 53ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:33] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2022-06-02 20:09:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-06-02 20:09:33] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-02 20:09:33] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 50 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 152/152 transitions.
Applied a total of 0 rules in 9 ms. Remains 153 /153 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 152/152 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 152/152 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:34] [INFO ] Computed 40 place invariants in 4 ms
[2022-06-02 20:09:34] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:34] [INFO ] Computed 40 place invariants in 2 ms
[2022-06-02 20:09:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:09:34] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-06-02 20:09:34] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:34] [INFO ] Computed 40 place invariants in 2 ms
[2022-06-02 20:09:34] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 152/152 transitions.
Incomplete random walk after 1000000 steps, including 35592 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5882 resets, run finished after 2019 ms. (steps per millisecond=495 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6059627 steps, run timeout after 9001 ms. (steps per millisecond=673 ) properties seen :{}
Probabilistic random walk after 6059627 steps, saw 1073081 distinct states, run finished after 9001 ms. (steps per millisecond=673 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:47] [INFO ] Computed 40 place invariants in 3 ms
[2022-06-02 20:09:47] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:09:47] [INFO ] [Nat]Absence check using 24 positive place invariants in 3 ms returned sat
[2022-06-02 20:09:47] [INFO ] [Nat]Absence check using 24 positive and 16 generalized place invariants in 6 ms returned sat
[2022-06-02 20:09:47] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:09:47] [INFO ] After 54ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:47] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2022-06-02 20:09:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-06-02 20:09:47] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-06-02 20:09:47] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 50 out of 153 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 152/152 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 153/153 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:47] [INFO ] Computed 40 place invariants in 2 ms
[2022-06-02 20:09:47] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:47] [INFO ] Computed 40 place invariants in 1 ms
[2022-06-02 20:09:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:09:47] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2022-06-02 20:09:47] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:47] [INFO ] Computed 40 place invariants in 2 ms
[2022-06-02 20:09:47] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 152 rows 153 cols
[2022-06-02 20:09:47] [INFO ] Computed 40 place invariants in 1 ms
[2022-06-02 20:09:47] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:09:47] [INFO ] [Nat]Absence check using 24 positive place invariants in 3 ms returned sat
[2022-06-02 20:09:47] [INFO ] [Nat]Absence check using 24 positive and 16 generalized place invariants in 4 ms returned sat
[2022-06-02 20:09:47] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:48] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2022-06-02 20:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-06-02 20:09:48] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-06-02 20:09:48] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:09:48] [INFO ] Flatten gal took : 46 ms
[2022-06-02 20:09:48] [INFO ] Flatten gal took : 16 ms
[2022-06-02 20:09:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17959844667116791767.gal : 8 ms
[2022-06-02 20:09:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15365723568751688003.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17959844667116791767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15365723568751688003.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15365723568751688003.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 210
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :210 after 2536
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2536 after 9534
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9534 after 10256
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :10256 after 40182
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :40182 after 144840
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :144840 after 356360
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :356360 after 1.14827e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.14827e+06 after 5.3365e+06
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,8.09034e+09,1.71473,53244,2,17125,17,206622,7,0,839,197285,0
Total reachable state count : 8090339652

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-07-ReachabilityFireability-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-07-ReachabilityFireability-12,0,1.7307,53244,1,0,17,206622,7,0,883,197285,0
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-12 TRUE TECHNIQUES OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 67275 ms.

BK_STOP 1654200590152

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-07"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-07, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918400375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;