Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694900599.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 189K Mar 5 18:22 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-19-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678649278259

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:27:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:27:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:27:59] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-12 19:27:59] [INFO ] Transformed 772 places.
[2023-03-12 19:27:59] [INFO ] Transformed 685 transitions.
[2023-03-12 19:27:59] [INFO ] Found NUPN structural information;
[2023-03-12 19:27:59] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 670 rows 757 cols
[2023-03-12 19:28:01] [INFO ] Computed 125 place invariants in 38 ms
[2023-03-12 19:28:01] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 19:28:02] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2023-03-12 19:28:02] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-12 19:28:03] [INFO ] After 1113ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-12 19:28:03] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 10 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 1 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 2 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 1 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:28:04] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:28:05] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 1 ms to minimize.
[2023-03-12 19:28:05] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2023-03-12 19:28:05] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-12 19:28:05] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2023-03-12 19:28:05] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 0 ms to minimize.
[2023-03-12 19:28:06] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-12 19:28:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2683 ms
[2023-03-12 19:28:06] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 0 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 1 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 0 ms to minimize.
[2023-03-12 19:28:07] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 1 ms to minimize.
[2023-03-12 19:28:08] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 0 ms to minimize.
[2023-03-12 19:28:08] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 1 ms to minimize.
[2023-03-12 19:28:08] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 1 ms to minimize.
[2023-03-12 19:28:08] [INFO ] Deduced a trap composed of 173 places in 153 ms of which 1 ms to minimize.
[2023-03-12 19:28:09] [INFO ] Deduced a trap composed of 184 places in 188 ms of which 1 ms to minimize.
[2023-03-12 19:28:09] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 0 ms to minimize.
[2023-03-12 19:28:09] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 0 ms to minimize.
[2023-03-12 19:28:09] [INFO ] Deduced a trap composed of 195 places in 157 ms of which 1 ms to minimize.
[2023-03-12 19:28:09] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 1 ms to minimize.
[2023-03-12 19:28:10] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2023-03-12 19:28:10] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 0 ms to minimize.
[2023-03-12 19:28:10] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 0 ms to minimize.
[2023-03-12 19:28:10] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2023-03-12 19:28:10] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2023-03-12 19:28:10] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4295 ms
[2023-03-12 19:28:11] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 0 ms to minimize.
[2023-03-12 19:28:11] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-12 19:28:11] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 1 ms to minimize.
[2023-03-12 19:28:12] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2023-03-12 19:28:12] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 1 ms to minimize.
[2023-03-12 19:28:12] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 1 ms to minimize.
[2023-03-12 19:28:12] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2023-03-12 19:28:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1347 ms
[2023-03-12 19:28:12] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 1 ms to minimize.
[2023-03-12 19:28:13] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:28:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2023-03-12 19:28:13] [INFO ] After 11034ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 1155 ms.
[2023-03-12 19:28:14] [INFO ] After 12562ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 103 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 748 transition count 586
Reduce places removed 83 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 92 rules applied. Total rules applied 176 place count 665 transition count 577
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 185 place count 656 transition count 577
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 127 Pre rules applied. Total rules applied 185 place count 656 transition count 450
Deduced a syphon composed of 127 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 265 rules applied. Total rules applied 450 place count 518 transition count 450
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 532 place count 436 transition count 368
Iterating global reduction 3 with 82 rules applied. Total rules applied 614 place count 436 transition count 368
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 614 place count 436 transition count 365
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 621 place count 432 transition count 365
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 811 place count 336 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 812 place count 336 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 814 place count 335 transition count 273
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 815 place count 335 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 334 transition count 272
Applied a total of 816 rules in 156 ms. Remains 334 /757 variables (removed 423) and now considering 272/670 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 334/757 places, 272/670 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 669244 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{2=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 669244 steps, saw 110823 distinct states, run finished after 3002 ms. (steps per millisecond=222 ) properties seen :4
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 334 cols
[2023-03-12 19:28:18] [INFO ] Computed 103 place invariants in 6 ms
[2023-03-12 19:28:18] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:28:18] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-12 19:28:18] [INFO ] [Nat]Absence check using 70 positive and 33 generalized place invariants in 8 ms returned sat
[2023-03-12 19:28:18] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:28:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:28:19] [INFO ] After 373ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:28:19] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2023-03-12 19:28:19] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-12 19:28:19] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2023-03-12 19:28:19] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-12 19:28:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2023-03-12 19:28:19] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2023-03-12 19:28:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 642 ms
[2023-03-12 19:28:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-12 19:28:20] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-12 19:28:20] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-12 19:28:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2023-03-12 19:28:20] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
[2023-03-12 19:28:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-12 19:28:20] [INFO ] After 1727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 461 ms.
[2023-03-12 19:28:21] [INFO ] After 2755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 86 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 272/272 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 334 transition count 265
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 325 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 324 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 324 transition count 264
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 316 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 315 transition count 255
Applied a total of 35 rules in 62 ms. Remains 315 /334 variables (removed 19) and now considering 255/272 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 315/334 places, 255/272 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 561519 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 561519 steps, saw 97077 distinct states, run finished after 3002 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 255 rows 315 cols
[2023-03-12 19:28:24] [INFO ] Computed 101 place invariants in 7 ms
[2023-03-12 19:28:24] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 19:28:24] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2023-03-12 19:28:24] [INFO ] [Nat]Absence check using 70 positive and 31 generalized place invariants in 12 ms returned sat
[2023-03-12 19:28:24] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 19:28:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:28:25] [INFO ] After 327ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 19:28:25] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 1 ms to minimize.
[2023-03-12 19:28:25] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-12 19:28:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2023-03-12 19:28:25] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-12 19:28:25] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 446 ms
[2023-03-12 19:28:26] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2023-03-12 19:28:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 314 ms
[2023-03-12 19:28:26] [INFO ] After 1682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 473 ms.
[2023-03-12 19:28:27] [INFO ] After 2654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 28 ms.
Support contains 63 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 255/255 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 1 place count 315 transition count 254
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 314 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 313 transition count 253
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4 place count 313 transition count 249
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 12 place count 309 transition count 249
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 307 transition count 247
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 307 transition count 247
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 50 place count 290 transition count 230
Applied a total of 50 rules in 45 ms. Remains 290 /315 variables (removed 25) and now considering 230/255 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 290/315 places, 230/255 transitions.
Incomplete random walk after 10000 steps, including 404 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 916362 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{1=1}
Probabilistic random walk after 916362 steps, saw 158828 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 230 rows 290 cols
[2023-03-12 19:28:30] [INFO ] Computed 101 place invariants in 7 ms
[2023-03-12 19:28:30] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:28:30] [INFO ] [Nat]Absence check using 70 positive place invariants in 28 ms returned sat
[2023-03-12 19:28:30] [INFO ] [Nat]Absence check using 70 positive and 31 generalized place invariants in 23 ms returned sat
[2023-03-12 19:28:30] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:28:30] [INFO ] After 115ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:31] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2023-03-12 19:28:31] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-12 19:28:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
[2023-03-12 19:28:31] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-12 19:28:31] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-12 19:28:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 368 ms
[2023-03-12 19:28:31] [INFO ] After 594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-12 19:28:31] [INFO ] After 1064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 45 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 230/230 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 290 transition count 227
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 287 transition count 227
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 287 transition count 220
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 23 place count 277 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 275 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 275 transition count 218
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 50 place count 263 transition count 207
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 263 transition count 207
Applied a total of 51 rules in 43 ms. Remains 263 /290 variables (removed 27) and now considering 207/230 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 263/290 places, 207/230 transitions.
Incomplete random walk after 10000 steps, including 417 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 880636 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :{}
Probabilistic random walk after 880636 steps, saw 151171 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 263 cols
[2023-03-12 19:28:34] [INFO ] Computed 97 place invariants in 12 ms
[2023-03-12 19:28:34] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:28:34] [INFO ] [Nat]Absence check using 71 positive place invariants in 15 ms returned sat
[2023-03-12 19:28:34] [INFO ] [Nat]Absence check using 71 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-12 19:28:35] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:28:35] [INFO ] After 132ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:35] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-12 19:28:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-12 19:28:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-12 19:28:35] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-12 19:28:35] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 45 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 207/207 transitions.
Applied a total of 0 rules in 8 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 263/263 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 207/207 transitions.
Applied a total of 0 rules in 7 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-12 19:28:35] [INFO ] Invariant cache hit.
[2023-03-12 19:28:35] [INFO ] Implicit Places using invariants in 135 ms returned [14, 23, 24, 84, 203, 207, 217]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 138 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/263 places, 207/207 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 153 ms. Remains : 256/263 places, 207/207 transitions.
Incomplete random walk after 10000 steps, including 420 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 959682 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 959682 steps, saw 164280 distinct states, run finished after 3007 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 256 cols
[2023-03-12 19:28:38] [INFO ] Computed 90 place invariants in 10 ms
[2023-03-12 19:28:38] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:28:39] [INFO ] [Nat]Absence check using 69 positive place invariants in 16 ms returned sat
[2023-03-12 19:28:39] [INFO ] [Nat]Absence check using 69 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-12 19:28:39] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:28:39] [INFO ] After 149ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:39] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:28:39] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-12 19:28:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-12 19:28:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2023-03-12 19:28:39] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-12 19:28:40] [INFO ] After 1061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 45 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 14 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 256/256 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 11 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-12 19:28:40] [INFO ] Invariant cache hit.
[2023-03-12 19:28:40] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-12 19:28:40] [INFO ] Invariant cache hit.
[2023-03-12 19:28:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:28:40] [INFO ] Implicit Places using invariants and state equation in 530 ms returned [93, 165, 168, 170, 172, 173, 175, 177, 179, 181, 184]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 720 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 245/256 places, 207/207 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 203
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 241 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 240 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 240 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 237 transition count 199
Applied a total of 16 rules in 16 ms. Remains 237 /245 variables (removed 8) and now considering 199/207 (removed 8) transitions.
// Phase 1: matrix 199 rows 237 cols
[2023-03-12 19:28:40] [INFO ] Computed 79 place invariants in 5 ms
[2023-03-12 19:28:40] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-12 19:28:40] [INFO ] Invariant cache hit.
[2023-03-12 19:28:41] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 19:28:41] [INFO ] Implicit Places using invariants and state equation in 357 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 536 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/256 places, 199/207 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1293 ms. Remains : 235/256 places, 199/207 transitions.
Incomplete random walk after 10000 steps, including 422 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1227934 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :{}
Probabilistic random walk after 1227934 steps, saw 215880 distinct states, run finished after 3003 ms. (steps per millisecond=408 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 199 rows 235 cols
[2023-03-12 19:28:44] [INFO ] Computed 77 place invariants in 9 ms
[2023-03-12 19:28:44] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:28:44] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-12 19:28:44] [INFO ] [Nat]Absence check using 57 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-12 19:28:44] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 19:28:44] [INFO ] After 76ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:44] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-12 19:28:44] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2023-03-12 19:28:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-12 19:28:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2023-03-12 19:28:45] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-12 19:28:45] [INFO ] After 750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 45 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 199/199 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 235/235 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 199/199 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-12 19:28:45] [INFO ] Invariant cache hit.
[2023-03-12 19:28:45] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-12 19:28:45] [INFO ] Invariant cache hit.
[2023-03-12 19:28:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 19:28:45] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2023-03-12 19:28:45] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-12 19:28:45] [INFO ] Invariant cache hit.
[2023-03-12 19:28:45] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 235/235 places, 199/199 transitions.
Graph (complete) has 758 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 231 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 231 transition count 198
Applied a total of 3 rules in 10 ms. Remains 231 /235 variables (removed 4) and now considering 198/199 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 231 cols
[2023-03-12 19:28:45] [INFO ] Computed 74 place invariants in 7 ms
[2023-03-12 19:28:46] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:28:46] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-12 19:28:46] [INFO ] [Nat]Absence check using 56 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-12 19:28:46] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:46] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2023-03-12 19:28:46] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-12 19:28:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2023-03-12 19:28:46] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-12 19:28:46] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:28:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-12 19:28:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 199 transitions and 937 arcs took 4 ms.
[2023-03-12 19:28:46] [INFO ] Flatten gal took : 65 ms
Total runtime 47069 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/802/inv_0_ --inv-par
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678649330905

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name BusinessProcesses-PT-19-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/802/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 235 places, 199 transitions and 937 arcs
pnml2lts-sym: Petri net BusinessProcesses_PT_19 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 199->191 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 235; there are 191 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/802/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 3.320 real 13.260 user 0.000 sys
pnml2lts-sym: max token count: 2

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-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-19, 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 r041-tajo-167813694900599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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