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-167813694900564.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-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 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 157K 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-15-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678646203415

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:36:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:36:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:36:45] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-12 18:36:45] [INFO ] Transformed 630 places.
[2023-03-12 18:36:45] [INFO ] Transformed 566 transitions.
[2023-03-12 18:36:45] [INFO ] Found NUPN structural information;
[2023-03-12 18:36:45] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 90 place count 536 transition count 475
Iterating global reduction 1 with 87 rules applied. Total rules applied 177 place count 536 transition count 475
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 217 place count 496 transition count 435
Iterating global reduction 1 with 40 rules applied. Total rules applied 257 place count 496 transition count 435
Applied a total of 257 rules in 118 ms. Remains 496 /626 variables (removed 130) and now considering 435/562 (removed 127) transitions.
// Phase 1: matrix 435 rows 496 cols
[2023-03-12 18:36:45] [INFO ] Computed 99 place invariants in 27 ms
[2023-03-12 18:36:45] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-12 18:36:45] [INFO ] Invariant cache hit.
[2023-03-12 18:36:46] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2023-03-12 18:36:46] [INFO ] Invariant cache hit.
[2023-03-12 18:36:46] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 496/626 places, 435/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1301 ms. Remains : 496/626 places, 435/562 transitions.
Support contains 29 out of 496 places after structural reductions.
[2023-03-12 18:36:46] [INFO ] Flatten gal took : 76 ms
[2023-03-12 18:36:46] [INFO ] Flatten gal took : 34 ms
[2023-03-12 18:36:46] [INFO ] Input system was already deterministic with 435 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 23) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-12 18:36:47] [INFO ] Invariant cache hit.
[2023-03-12 18:36:47] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2023-03-12 18:36:47] [INFO ] [Real]Absence check using 58 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-12 18:36:47] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 18:36:48] [INFO ] [Nat]Absence check using 58 positive place invariants in 15 ms returned sat
[2023-03-12 18:36:48] [INFO ] [Nat]Absence check using 58 positive and 41 generalized place invariants in 12 ms returned sat
[2023-03-12 18:36:48] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-12 18:36:48] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 10 ms to minimize.
[2023-03-12 18:36:48] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:36:48] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-12 18:36:48] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2023-03-12 18:36:49] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2023-03-12 18:36:49] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2023-03-12 18:36:49] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2023-03-12 18:36:49] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2023-03-12 18:36:49] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2023-03-12 18:36:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 939 ms
[2023-03-12 18:36:49] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 0 ms to minimize.
[2023-03-12 18:36:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-12 18:36:49] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 1 ms to minimize.
[2023-03-12 18:36:49] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:36:50] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2023-03-12 18:36:50] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:36:50] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 0 ms to minimize.
[2023-03-12 18:36:50] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 0 ms to minimize.
[2023-03-12 18:36:50] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2023-03-12 18:36:50] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:36:51] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:36:51] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:36:51] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 1 ms to minimize.
[2023-03-12 18:36:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1678 ms
[2023-03-12 18:36:51] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2023-03-12 18:36:51] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2023-03-12 18:36:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2023-03-12 18:36:51] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2023-03-12 18:36:51] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2023-03-12 18:36:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2023-03-12 18:36:52] [INFO ] After 3879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-03-12 18:36:52] [INFO ] After 4440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 2 properties in 272 ms.
Support contains 18 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 218 edges and 496 vertex of which 4 / 496 are part of one of the 1 SCC in 8 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1116 edges and 493 vertex of which 492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 492 transition count 383
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 445 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 443 transition count 381
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 100 place count 443 transition count 282
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 316 place count 326 transition count 282
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 320 place count 322 transition count 278
Iterating global reduction 3 with 4 rules applied. Total rules applied 324 place count 322 transition count 278
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 576 place count 195 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 578 place count 194 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 580 place count 194 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 582 place count 192 transition count 155
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 587 place count 192 transition count 155
Applied a total of 587 rules in 136 ms. Remains 192 /496 variables (removed 304) and now considering 155/435 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 192/496 places, 155/435 transitions.
Incomplete random walk after 10000 steps, including 983 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 295 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 271 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 289 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 155 rows 192 cols
[2023-03-12 18:36:53] [INFO ] Computed 79 place invariants in 7 ms
[2023-03-12 18:36:53] [INFO ] [Real]Absence check using 59 positive place invariants in 7 ms returned sat
[2023-03-12 18:36:53] [INFO ] [Real]Absence check using 59 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-12 18:36:53] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-12 18:36:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-12 18:36:53] [INFO ] After 59ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 18:36:53] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 18:36:53] [INFO ] [Nat]Absence check using 59 positive place invariants in 10 ms returned sat
[2023-03-12 18:36:53] [INFO ] [Nat]Absence check using 59 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-12 18:36:53] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 18:36:53] [INFO ] After 38ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 18:36:53] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-12 18:36:53] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 155/155 transitions.
Graph (trivial) has 11 edges and 192 vertex of which 2 / 192 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 191 transition count 148
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 184 transition count 148
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 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 29 place count 175 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 175 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 174 transition count 140
Applied a total of 31 rules in 40 ms. Remains 174 /192 variables (removed 18) and now considering 140/155 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 174/192 places, 140/155 transitions.
Incomplete random walk after 10000 steps, including 284 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 197 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 191 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 186 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 140 rows 174 cols
[2023-03-12 18:36:54] [INFO ] Computed 75 place invariants in 2 ms
[2023-03-12 18:36:55] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-12 18:36:55] [INFO ] [Real]Absence check using 57 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-12 18:36:55] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-12 18:36:55] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 18:36:55] [INFO ] After 38ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 18:36:55] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 18:36:55] [INFO ] [Nat]Absence check using 57 positive place invariants in 6 ms returned sat
[2023-03-12 18:36:55] [INFO ] [Nat]Absence check using 57 positive and 18 generalized place invariants in 2 ms returned sat
[2023-03-12 18:36:55] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 18:36:55] [INFO ] After 48ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 18:36:55] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2023-03-12 18:36:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-12 18:36:55] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-12 18:36:55] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 95 steps, including 1 resets, run visited all 4 properties in 3 ms. (steps per millisecond=31 )
Parikh walk visited 4 properties in 3 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 208 stabilizing places and 180 stable transitions
Graph (complete) has 1120 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 231 edges and 496 vertex of which 6 / 496 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1114 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 489 transition count 374
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 436 transition count 374
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 108 place count 436 transition count 272
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 331 place count 315 transition count 272
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 340 place count 306 transition count 263
Iterating global reduction 2 with 9 rules applied. Total rules applied 349 place count 306 transition count 263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 349 place count 306 transition count 262
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 351 place count 305 transition count 262
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 607 place count 175 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 609 place count 174 transition count 140
Applied a total of 609 rules in 72 ms. Remains 174 /496 variables (removed 322) and now considering 140/435 (removed 295) transitions.
// Phase 1: matrix 140 rows 174 cols
[2023-03-12 18:36:55] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-12 18:36:56] [INFO ] Implicit Places using invariants in 355 ms returned [1, 2, 3, 4, 10, 11, 36, 37, 38, 39, 44, 45, 46, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 364 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/496 places, 140/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 153/496 places, 140/435 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s2 1), p0:(AND (EQ s10 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-00 finished in 717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 489 transition count 428
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 489 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 487 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 487 transition count 426
Applied a total of 18 rules in 33 ms. Remains 487 /496 variables (removed 9) and now considering 426/435 (removed 9) transitions.
// Phase 1: matrix 426 rows 487 cols
[2023-03-12 18:36:56] [INFO ] Computed 99 place invariants in 6 ms
[2023-03-12 18:36:56] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-12 18:36:56] [INFO ] Invariant cache hit.
[2023-03-12 18:36:57] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-12 18:36:57] [INFO ] Invariant cache hit.
[2023-03-12 18:36:57] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 487/496 places, 426/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 996 ms. Remains : 487/496 places, 426/435 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s64 1), p0:(EQ s392 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-02 finished in 1110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(X(!G(X(F(X(p0))))))||!p0)) U p1))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 485 transition count 424
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 485 transition count 424
Applied a total of 22 rules in 27 ms. Remains 485 /496 variables (removed 11) and now considering 424/435 (removed 11) transitions.
// Phase 1: matrix 424 rows 485 cols
[2023-03-12 18:36:57] [INFO ] Computed 99 place invariants in 5 ms
[2023-03-12 18:36:57] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-12 18:36:57] [INFO ] Invariant cache hit.
[2023-03-12 18:36:58] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-12 18:36:58] [INFO ] Invariant cache hit.
[2023-03-12 18:36:58] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/496 places, 424/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 485/496 places, 424/435 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s82 1), p0:(EQ s403 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-04 finished in 1086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U p1)))))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 486 transition count 425
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 486 transition count 425
Applied a total of 20 rules in 44 ms. Remains 486 /496 variables (removed 10) and now considering 425/435 (removed 10) transitions.
// Phase 1: matrix 425 rows 486 cols
[2023-03-12 18:36:58] [INFO ] Computed 99 place invariants in 9 ms
[2023-03-12 18:36:58] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 18:36:58] [INFO ] Invariant cache hit.
[2023-03-12 18:36:59] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-12 18:36:59] [INFO ] Invariant cache hit.
[2023-03-12 18:36:59] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/496 places, 425/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 926 ms. Remains : 486/496 places, 425/435 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s187 1), p0:(NEQ s416 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 680 reset in 375 ms.
Stack based approach found an accepted trace after 32946 steps with 223 reset with depth 7 and stack size 7 in 125 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-08 finished in 1601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(X(X(X(F(p2)))))))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 486 transition count 425
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 486 transition count 425
Applied a total of 20 rules in 38 ms. Remains 486 /496 variables (removed 10) and now considering 425/435 (removed 10) transitions.
// Phase 1: matrix 425 rows 486 cols
[2023-03-12 18:37:00] [INFO ] Computed 99 place invariants in 5 ms
[2023-03-12 18:37:00] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-12 18:37:00] [INFO ] Invariant cache hit.
[2023-03-12 18:37:01] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-12 18:37:01] [INFO ] Invariant cache hit.
[2023-03-12 18:37:01] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 486/496 places, 425/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1061 ms. Remains : 486/496 places, 425/435 transitions.
Stuttering acceptance computed with spot in 366 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 10}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 11}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 7}]], initial=2, aps=[p2:(EQ s407 0), p0:(EQ s407 1), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 483 ms.
Product exploration explored 100000 steps with 20000 reset in 245 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1108 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 278 ms. Reduced automaton from 12 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1043734 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1043734 steps, saw 159489 distinct states, run finished after 3002 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:37:05] [INFO ] Invariant cache hit.
[2023-03-12 18:37:05] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:37:06] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2023-03-12 18:37:06] [INFO ] [Nat]Absence check using 59 positive and 40 generalized place invariants in 16 ms returned sat
[2023-03-12 18:37:06] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:37:06] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:37:06] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-12 18:37:06] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-12 18:37:06] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2023-03-12 18:37:06] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2023-03-12 18:37:06] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 4 ms to minimize.
[2023-03-12 18:37:06] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2023-03-12 18:37:06] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-12 18:37:07] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2023-03-12 18:37:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 795 ms
[2023-03-12 18:37:07] [INFO ] After 960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-12 18:37:07] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 224 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1101 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 480 transition count 368
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 431 transition count 368
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 100 place count 431 transition count 263
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 330 place count 306 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 331 place count 305 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 332 place count 305 transition count 262
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 598 place count 170 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 169 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 602 place count 169 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 604 place count 167 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 605 place count 167 transition count 133
Applied a total of 605 rules in 53 ms. Remains 167 /486 variables (removed 319) and now considering 133/425 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 167/486 places, 133/425 transitions.
Incomplete random walk after 10000 steps, including 285 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 191 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2007 steps, run visited all 1 properties in 11 ms. (steps per millisecond=182 )
Probabilistic random walk after 2007 steps, saw 891 distinct states, run finished after 11 ms. (steps per millisecond=182 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 486 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 425/425 transitions.
Applied a total of 0 rules in 12 ms. Remains 486 /486 variables (removed 0) and now considering 425/425 (removed 0) transitions.
[2023-03-12 18:37:07] [INFO ] Invariant cache hit.
[2023-03-12 18:37:08] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-12 18:37:08] [INFO ] Invariant cache hit.
[2023-03-12 18:37:08] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-12 18:37:08] [INFO ] Invariant cache hit.
[2023-03-12 18:37:09] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1109 ms. Remains : 486/486 places, 425/425 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1108 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [p2, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 932569 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 932569 steps, saw 143079 distinct states, run finished after 3002 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:37:12] [INFO ] Invariant cache hit.
[2023-03-12 18:37:12] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:37:12] [INFO ] [Nat]Absence check using 59 positive place invariants in 17 ms returned sat
[2023-03-12 18:37:12] [INFO ] [Nat]Absence check using 59 positive and 40 generalized place invariants in 28 ms returned sat
[2023-03-12 18:37:12] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:37:12] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-12 18:37:12] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-12 18:37:12] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-12 18:37:12] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-12 18:37:13] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-12 18:37:13] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-03-12 18:37:13] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2023-03-12 18:37:13] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2023-03-12 18:37:13] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2023-03-12 18:37:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 689 ms
[2023-03-12 18:37:13] [INFO ] After 877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 18:37:13] [INFO ] After 1020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 224 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1101 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 480 transition count 368
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 431 transition count 368
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 100 place count 431 transition count 263
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 330 place count 306 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 331 place count 305 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 332 place count 305 transition count 262
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 598 place count 170 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 169 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 602 place count 169 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 604 place count 167 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 605 place count 167 transition count 133
Applied a total of 605 rules in 55 ms. Remains 167 /486 variables (removed 319) and now considering 133/425 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 167/486 places, 133/425 transitions.
Incomplete random walk after 10000 steps, including 293 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 194 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2007 steps, run visited all 1 properties in 12 ms. (steps per millisecond=167 )
Probabilistic random walk after 2007 steps, saw 891 distinct states, run finished after 13 ms. (steps per millisecond=154 ) properties seen :1
Knowledge obtained : [p2, true]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 20000 reset in 247 ms.
Product exploration explored 100000 steps with 20000 reset in 321 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 224 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1102 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 480 transition count 418
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 75 Pre rules applied. Total rules applied 51 place count 480 transition count 473
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 126 place count 480 transition count 473
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 144 place count 462 transition count 439
Deduced a syphon composed of 107 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 162 place count 462 transition count 439
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 267 places in 0 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 322 place count 462 transition count 439
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 360 place count 424 transition count 401
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 398 place count 424 transition count 401
Deduced a syphon composed of 229 places in 0 ms
Applied a total of 398 rules in 97 ms. Remains 424 /486 variables (removed 62) and now considering 401/425 (removed 24) transitions.
[2023-03-12 18:37:15] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 401 rows 424 cols
[2023-03-12 18:37:15] [INFO ] Computed 99 place invariants in 15 ms
[2023-03-12 18:37:15] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/486 places, 401/425 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 653 ms. Remains : 424/486 places, 401/425 transitions.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 425/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 485 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 485 transition count 424
Applied a total of 2 rules in 35 ms. Remains 485 /486 variables (removed 1) and now considering 424/425 (removed 1) transitions.
// Phase 1: matrix 424 rows 485 cols
[2023-03-12 18:37:15] [INFO ] Computed 99 place invariants in 4 ms
[2023-03-12 18:37:16] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-12 18:37:16] [INFO ] Invariant cache hit.
[2023-03-12 18:37:16] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-12 18:37:16] [INFO ] Invariant cache hit.
[2023-03-12 18:37:16] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/486 places, 424/425 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1040 ms. Remains : 485/486 places, 424/425 transitions.
Treatment of property BusinessProcesses-PT-15-LTLFireability-09 finished in 16636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p1&&X(p2))))))'
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 485 transition count 424
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 485 transition count 424
Applied a total of 22 rules in 22 ms. Remains 485 /496 variables (removed 11) and now considering 424/435 (removed 11) transitions.
// Phase 1: matrix 424 rows 485 cols
[2023-03-12 18:37:16] [INFO ] Computed 99 place invariants in 3 ms
[2023-03-12 18:37:17] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-12 18:37:17] [INFO ] Invariant cache hit.
[2023-03-12 18:37:17] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2023-03-12 18:37:17] [INFO ] Invariant cache hit.
[2023-03-12 18:37:18] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 485/496 places, 424/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1129 ms. Remains : 485/496 places, 424/435 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s345 1), p1:(EQ s345 0), p2:(AND (EQ s173 1) (EQ s349 1) (EQ s479 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1781 reset in 160 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 1397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(p1))) U G(p2)))'
Support contains 5 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 487 transition count 426
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 487 transition count 426
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 484 transition count 423
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 22 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
// Phase 1: matrix 423 rows 484 cols
[2023-03-12 18:37:18] [INFO ] Computed 99 place invariants in 6 ms
[2023-03-12 18:37:18] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-12 18:37:18] [INFO ] Invariant cache hit.
[2023-03-12 18:37:19] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2023-03-12 18:37:19] [INFO ] Invariant cache hit.
[2023-03-12 18:37:19] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 484/496 places, 423/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 984 ms. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s10 1), p0:(OR (EQ s10 1) (AND (EQ s100 1) (EQ s289 1) (EQ s414 1))), p1:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-11 finished in 1209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 234 edges and 496 vertex of which 6 / 496 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1114 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 489 transition count 374
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 436 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 435 transition count 373
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 110 place count 435 transition count 270
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 335 place count 313 transition count 270
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 344 place count 304 transition count 261
Iterating global reduction 3 with 9 rules applied. Total rules applied 353 place count 304 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 353 place count 304 transition count 260
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 355 place count 303 transition count 260
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 615 place count 171 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 617 place count 170 transition count 136
Applied a total of 617 rules in 37 ms. Remains 170 /496 variables (removed 326) and now considering 136/435 (removed 299) transitions.
// Phase 1: matrix 136 rows 170 cols
[2023-03-12 18:37:19] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-12 18:37:19] [INFO ] Implicit Places using invariants in 121 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 48, 49, 50, 51, 52, 53, 54, 55, 139]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 135 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/496 places, 136/435 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 147/496 places, 136/435 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-12 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 231 edges and 496 vertex of which 4 / 496 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1117 edges and 493 vertex of which 492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 491 transition count 376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 437 transition count 376
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 110 place count 437 transition count 273
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 336 place count 314 transition count 273
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 344 place count 306 transition count 265
Iterating global reduction 2 with 8 rules applied. Total rules applied 352 place count 306 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 352 place count 306 transition count 264
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 354 place count 305 transition count 264
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 616 place count 172 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 618 place count 171 transition count 139
Applied a total of 618 rules in 33 ms. Remains 171 /496 variables (removed 325) and now considering 139/435 (removed 296) transitions.
// Phase 1: matrix 139 rows 171 cols
[2023-03-12 18:37:19] [INFO ] Computed 75 place invariants in 1 ms
[2023-03-12 18:37:19] [INFO ] Implicit Places using invariants in 205 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 207 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/496 places, 139/435 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 149/496 places, 139/435 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s98 0) (EQ s82 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13496 reset in 340 ms.
Stack based approach found an accepted trace after 71180 steps with 9638 reset with depth 17 and stack size 16 in 192 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-13 finished in 823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 234 edges and 496 vertex of which 6 / 496 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1114 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 489 transition count 373
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 435 transition count 373
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 110 place count 435 transition count 269
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 338 place count 311 transition count 269
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 346 place count 303 transition count 261
Iterating global reduction 2 with 8 rules applied. Total rules applied 354 place count 303 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 354 place count 303 transition count 260
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 356 place count 302 transition count 260
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 616 place count 170 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 618 place count 169 transition count 136
Applied a total of 618 rules in 74 ms. Remains 169 /496 variables (removed 327) and now considering 136/435 (removed 299) transitions.
// Phase 1: matrix 136 rows 169 cols
[2023-03-12 18:37:20] [INFO ] Computed 75 place invariants in 2 ms
[2023-03-12 18:37:20] [INFO ] Implicit Places using invariants in 189 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 191 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/496 places, 136/435 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 268 ms. Remains : 147/496 places, 136/435 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s100 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21714 reset in 208 ms.
Product exploration explored 100000 steps with 21584 reset in 226 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2475 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 759 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 59 steps, run visited all 1 properties in 5 ms. (steps per millisecond=11 )
Probabilistic random walk after 59 steps, saw 37 distinct states, run finished after 5 ms. (steps per millisecond=11 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 136/136 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
// Phase 1: matrix 136 rows 147 cols
[2023-03-12 18:37:21] [INFO ] Computed 53 place invariants in 1 ms
[2023-03-12 18:37:22] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-12 18:37:22] [INFO ] Invariant cache hit.
[2023-03-12 18:37:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:37:22] [INFO ] Implicit Places using invariants and state equation in 191 ms returned [3, 25, 27, 33, 35, 37, 39, 41, 43, 45, 52, 54, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 456 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/147 places, 136/136 transitions.
Graph (complete) has 383 edges and 117 vertex of which 108 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 108 transition count 119
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 95 transition count 119
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 39 place count 83 transition count 79
Iterating global reduction 2 with 12 rules applied. Total rules applied 51 place count 83 transition count 79
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 83 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 82 transition count 78
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 79 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 79 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 73 place count 71 transition count 69
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 4 with 4 rules applied. Total rules applied 77 place count 69 transition count 67
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 69 transition count 66
Applied a total of 78 rules in 8 ms. Remains 69 /117 variables (removed 48) and now considering 66/136 (removed 70) transitions.
// Phase 1: matrix 66 rows 69 cols
[2023-03-12 18:37:22] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-12 18:37:22] [INFO ] Implicit Places using invariants in 59 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 74 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/147 places, 66/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 545 ms. Remains : 66/147 places, 66/136 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2540 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 785 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 51 steps, run visited all 1 properties in 5 ms. (steps per millisecond=10 )
Probabilistic random walk after 51 steps, saw 33 distinct states, run finished after 5 ms. (steps per millisecond=10 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22091 reset in 85 ms.
Product exploration explored 100000 steps with 22306 reset in 82 ms.
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 66 cols
[2023-03-12 18:37:23] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 18:37:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 18:37:23] [INFO ] Invariant cache hit.
[2023-03-12 18:37:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:37:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [5, 13, 19, 21]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 174 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/66 places, 66/66 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 62 transition count 63
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 59 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 57 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 57 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 57 transition count 59
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 34 place count 43 transition count 50
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 40 transition count 47
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 40 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 40 transition count 46
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 4 with 2 rules applied. Total rules applied 43 place count 39 transition count 45
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 39 transition count 43
Applied a total of 45 rules in 6 ms. Remains 39 /62 variables (removed 23) and now considering 43/66 (removed 23) transitions.
// Phase 1: matrix 43 rows 39 cols
[2023-03-12 18:37:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 18:37:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 18:37:23] [INFO ] Invariant cache hit.
[2023-03-12 18:37:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 18:37:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/66 places, 43/66 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 39/66 places, 43/66 transitions.
Treatment of property BusinessProcesses-PT-15-LTLFireability-14 finished in 2808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(X(X(X(F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 18:37:23] [INFO ] Flatten gal took : 49 ms
[2023-03-12 18:37:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 18:37:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 496 places, 435 transitions and 1401 arcs took 8 ms.
Total runtime 38655 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BusinessProcesses-PT-15-LTLFireability-09
Could not compute solution for formula : BusinessProcesses-PT-15-LTLFireability-14

BK_STOP 1678646244470

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BusinessProcesses-PT-15-LTLFireability-09
ltl formula formula --ltl=/tmp/1337/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 496 places, 435 transitions and 1401 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BusinessProcesses-PT-15-LTLFireability-14
ltl formula formula --ltl=/tmp/1337/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 496 places, 435 transitions and 1401 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5596279233f4]
1: pnml2lts-mc(+0xa2496) [0x559627923496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f0ec9cf5140]
3: pnml2lts-mc(+0x405be5) [0x559627c86be5]
4: pnml2lts-mc(+0x16b3f9) [0x5596279ec3f9]
5: pnml2lts-mc(+0x164ac4) [0x5596279e5ac4]
6: pnml2lts-mc(+0x272e0a) [0x559627af3e0a]
7: pnml2lts-mc(+0xb61f0) [0x5596279371f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f0ec9b484d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f0ec9b4867a]
10: pnml2lts-mc(+0xa1581) [0x559627922581]
11: pnml2lts-mc(+0xa1910) [0x559627922910]
12: pnml2lts-mc(+0xa32a2) [0x5596279242a2]
13: pnml2lts-mc(+0xa50f4) [0x5596279260f4]
14: pnml2lts-mc(+0xa516b) [0x55962792616b]
15: pnml2lts-mc(+0x3f34b3) [0x559627c744b3]
16: pnml2lts-mc(+0x7c63d) [0x5596278fd63d]
17: pnml2lts-mc(+0x67d86) [0x5596278e8d86]
18: pnml2lts-mc(+0x60a8a) [0x5596278e1a8a]
19: pnml2lts-mc(+0x5eb15) [0x5596278dfb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f0ec9b30d0a]
21: pnml2lts-mc(+0x6075e) [0x5596278e175e]

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-15"
export BK_EXAMINATION="LTLFireability"
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-15, examination is LTLFireability"
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-167813694900564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;