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.r039-tajo-167813692700596.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 lolaxred
Input is BusinessProcesses-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 189K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678503670728

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:01:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:01:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:01:12] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-11 03:01:12] [INFO ] Transformed 772 places.
[2023-03-11 03:01:12] [INFO ] Transformed 685 transitions.
[2023-03-11 03:01:12] [INFO ] Found NUPN structural information;
[2023-03-11 03:01:12] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 15 places in 15 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 109 place count 648 transition count 569
Iterating global reduction 1 with 101 rules applied. Total rules applied 210 place count 648 transition count 569
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 261 place count 597 transition count 518
Iterating global reduction 1 with 51 rules applied. Total rules applied 312 place count 597 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 313 place count 596 transition count 517
Iterating global reduction 1 with 1 rules applied. Total rules applied 314 place count 596 transition count 517
Applied a total of 314 rules in 155 ms. Remains 596 /757 variables (removed 161) and now considering 517/670 (removed 153) transitions.
// Phase 1: matrix 517 rows 596 cols
[2023-03-11 03:01:12] [INFO ] Computed 117 place invariants in 49 ms
[2023-03-11 03:01:13] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-11 03:01:13] [INFO ] Invariant cache hit.
[2023-03-11 03:01:13] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2023-03-11 03:01:13] [INFO ] Invariant cache hit.
[2023-03-11 03:01:14] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/757 places, 517/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1486 ms. Remains : 596/757 places, 517/670 transitions.
Support contains 44 out of 596 places after structural reductions.
[2023-03-11 03:01:14] [INFO ] Flatten gal took : 63 ms
[2023-03-11 03:01:14] [INFO ] Flatten gal took : 27 ms
[2023-03-11 03:01:14] [INFO ] Input system was already deterministic with 517 transitions.
Support contains 43 out of 596 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 28) seen :9
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-11 03:01:15] [INFO ] Invariant cache hit.
[2023-03-11 03:01:15] [INFO ] [Real]Absence check using 70 positive place invariants in 21 ms returned sat
[2023-03-11 03:01:15] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-11 03:01:15] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:18
[2023-03-11 03:01:15] [INFO ] [Nat]Absence check using 70 positive place invariants in 17 ms returned sat
[2023-03-11 03:01:15] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 16 ms returned sat
[2023-03-11 03:01:16] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :16
[2023-03-11 03:01:16] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 5 ms to minimize.
[2023-03-11 03:01:16] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2023-03-11 03:01:16] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:01:17] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2023-03-11 03:01:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 743 ms
[2023-03-11 03:01:17] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-03-11 03:01:17] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-11 03:01:17] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2023-03-11 03:01:17] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 1 ms to minimize.
[2023-03-11 03:01:17] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 1 ms to minimize.
[2023-03-11 03:01:17] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 1 ms to minimize.
[2023-03-11 03:01:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 793 ms
[2023-03-11 03:01:18] [INFO ] After 2659ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :16
Attempting to minimize the solution found.
Minimization took 422 ms.
[2023-03-11 03:01:19] [INFO ] After 3426ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :16
Fused 19 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 342 ms.
Support contains 23 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (complete) has 1320 edges and 596 vertex of which 595 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
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 595 transition count 453
Reduce places removed 63 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 66 rules applied. Total rules applied 130 place count 532 transition count 450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 529 transition count 450
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 133 place count 529 transition count 335
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 386 place count 391 transition count 335
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 391 place count 386 transition count 330
Iterating global reduction 3 with 5 rules applied. Total rules applied 396 place count 386 transition count 330
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 710 place count 227 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 711 place count 227 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 713 place count 226 transition count 177
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 720 place count 226 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 721 place count 225 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 722 place count 224 transition count 176
Applied a total of 722 rules in 142 ms. Remains 224 /596 variables (removed 372) and now considering 176/517 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 224/596 places, 176/517 transitions.
Incomplete random walk after 10000 steps, including 964 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 245 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 246 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 239 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 252 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 208 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 218 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 176 rows 224 cols
[2023-03-11 03:01:20] [INFO ] Computed 89 place invariants in 8 ms
[2023-03-11 03:01:20] [INFO ] [Real]Absence check using 69 positive place invariants in 11 ms returned sat
[2023-03-11 03:01:20] [INFO ] [Real]Absence check using 69 positive and 20 generalized place invariants in 9 ms returned sat
[2023-03-11 03:01:20] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 03:01:20] [INFO ] [Nat]Absence check using 69 positive place invariants in 8 ms returned sat
[2023-03-11 03:01:20] [INFO ] [Nat]Absence check using 69 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-11 03:01:20] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 03:01:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 03:01:21] [INFO ] After 131ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-11 03:01:21] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2023-03-11 03:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-11 03:01:21] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 0 ms to minimize.
[2023-03-11 03:01:21] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 0 ms to minimize.
[2023-03-11 03:01:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-03-11 03:01:21] [INFO ] After 667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-11 03:01:21] [INFO ] After 1134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 14 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 176/176 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 224 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 221 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 221 transition count 171
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 219 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 216 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 216 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 216 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 214 transition count 167
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 212 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 212 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 211 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 211 transition count 164
Applied a total of 26 rules in 38 ms. Remains 211 /224 variables (removed 13) and now considering 164/176 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 211/224 places, 164/176 transitions.
Incomplete random walk after 10000 steps, including 1368 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 437 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 426 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Finished probabilistic random walk after 1546 steps, run visited all 9 properties in 23 ms. (steps per millisecond=67 )
Probabilistic random walk after 1546 steps, saw 610 distinct states, run finished after 23 ms. (steps per millisecond=67 ) properties seen :9
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-19-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 537 stabilizing places and 468 stable transitions
Graph (complete) has 1320 edges and 596 vertex of which 595 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p1))||p0)))'
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 284 edges and 596 vertex of which 6 / 596 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1314 edges and 591 vertex of which 590 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 589 transition count 438
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 518 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 146 place count 517 transition count 316
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 412 place count 372 transition count 316
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 422 place count 362 transition count 306
Iterating global reduction 3 with 10 rules applied. Total rules applied 432 place count 362 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 432 place count 362 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 435 place count 360 transition count 305
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 751 place count 200 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 753 place count 199 transition count 152
Applied a total of 753 rules in 67 ms. Remains 199 /596 variables (removed 397) and now considering 152/517 (removed 365) transitions.
// Phase 1: matrix 152 rows 199 cols
[2023-03-11 03:01:23] [INFO ] Computed 88 place invariants in 2 ms
[2023-03-11 03:01:23] [INFO ] Implicit Places using invariants in 129 ms returned [1, 2, 3, 4, 14, 15, 16, 17, 18, 19, 24, 25, 26, 27, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 62, 63, 64, 173]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 132 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/596 places, 152/517 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 171/596 places, 152/517 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s37 1) (EQ s11 1)), p1:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1887 steps with 409 reset in 22 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-00 finished in 455 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 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 286 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 589 transition count 437
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 146 place count 517 transition count 314
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 417 place count 369 transition count 314
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 428 place count 358 transition count 303
Iterating global reduction 2 with 11 rules applied. Total rules applied 439 place count 358 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 439 place count 358 transition count 301
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 444 place count 355 transition count 301
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 756 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 758 place count 196 transition count 150
Applied a total of 758 rules in 64 ms. Remains 196 /596 variables (removed 400) and now considering 150/517 (removed 367) transitions.
// Phase 1: matrix 150 rows 196 cols
[2023-03-11 03:01:23] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-11 03:01:23] [INFO ] Implicit Places using invariants in 137 ms returned [1, 2, 3, 4, 5, 13, 14, 18, 19, 20, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 139 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/596 places, 150/517 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 169/596 places, 150/517 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 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-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-01 finished in 251 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(F(p0))))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 582 transition count 503
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 582 transition count 503
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 578 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 578 transition count 499
Applied a total of 36 rules in 38 ms. Remains 578 /596 variables (removed 18) and now considering 499/517 (removed 18) transitions.
// Phase 1: matrix 499 rows 578 cols
[2023-03-11 03:01:23] [INFO ] Computed 117 place invariants in 9 ms
[2023-03-11 03:01:24] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-11 03:01:24] [INFO ] Invariant cache hit.
[2023-03-11 03:01:24] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-03-11 03:01:24] [INFO ] Invariant cache hit.
[2023-03-11 03:01:25] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/596 places, 499/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1160 ms. Remains : 578/596 places, 499/517 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s161 0) (EQ s515 0))], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 319 ms.
Product exploration explored 100000 steps with 33333 reset in 297 ms.
Computed a total of 521 stabilizing places and 452 stable transitions
Graph (complete) has 1293 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 521 stabilizing places and 452 stable transitions
Detected a total of 521/578 stabilizing places and 452/499 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-02 finished in 1954 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 U p1))))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 286 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 589 transition count 437
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 146 place count 517 transition count 315
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 415 place count 370 transition count 315
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 426 place count 359 transition count 304
Iterating global reduction 2 with 11 rules applied. Total rules applied 437 place count 359 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 437 place count 359 transition count 302
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 442 place count 356 transition count 302
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 756 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 758 place count 196 transition count 150
Applied a total of 758 rules in 46 ms. Remains 196 /596 variables (removed 400) and now considering 150/517 (removed 367) transitions.
// Phase 1: matrix 150 rows 196 cols
[2023-03-11 03:01:25] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-11 03:01:26] [INFO ] Implicit Places using invariants in 148 ms returned [1, 2, 3, 4, 14, 15, 16, 17, 18, 19, 22, 23, 24, 25, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 150 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/596 places, 150/517 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 169/596 places, 150/517 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(NEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-03 finished in 305 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&&G(p1)) U X(p0)))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 584 transition count 505
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 580 transition count 501
Applied a total of 32 rules in 43 ms. Remains 580 /596 variables (removed 16) and now considering 501/517 (removed 16) transitions.
// Phase 1: matrix 501 rows 580 cols
[2023-03-11 03:01:26] [INFO ] Computed 117 place invariants in 13 ms
[2023-03-11 03:01:26] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-11 03:01:26] [INFO ] Invariant cache hit.
[2023-03-11 03:01:27] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2023-03-11 03:01:27] [INFO ] Invariant cache hit.
[2023-03-11 03:01:27] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/596 places, 501/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 580/596 places, 501/517 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s435 1), p1:(NEQ s55 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]]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1295 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-07 finished in 2202 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 (p1||G(!p0))) U p2))'
Support contains 6 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 284 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 589 transition count 438
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 518 transition count 438
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 144 place count 518 transition count 317
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 411 place count 372 transition count 317
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 422 place count 361 transition count 306
Iterating global reduction 2 with 11 rules applied. Total rules applied 433 place count 361 transition count 306
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 433 place count 361 transition count 304
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 438 place count 358 transition count 304
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 746 place count 202 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 748 place count 201 transition count 155
Applied a total of 748 rules in 47 ms. Remains 201 /596 variables (removed 395) and now considering 155/517 (removed 362) transitions.
// Phase 1: matrix 155 rows 201 cols
[2023-03-11 03:01:28] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-11 03:01:28] [INFO ] Implicit Places using invariants in 104 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 22, 23, 24, 25, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 105 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/596 places, 155/517 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 173/596 places, 155/517 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), true, (AND (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s65 1) (EQ s36 1)), p1:(AND (NEQ s67 1) (NOT (AND (EQ s8 1) (EQ s80 1) (EQ s118 1)))), p0:(AND (EQ s8 1) (EQ s80 1) (EQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-10 finished in 243 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)&&F(p1))))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 285 edges and 596 vertex of which 6 / 596 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1314 edges and 591 vertex of which 590 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 589 transition count 437
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 146 place count 517 transition count 315
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 415 place count 370 transition count 315
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 426 place count 359 transition count 304
Iterating global reduction 2 with 11 rules applied. Total rules applied 437 place count 359 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 437 place count 359 transition count 302
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 442 place count 356 transition count 302
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 754 place count 198 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 756 place count 197 transition count 151
Applied a total of 756 rules in 37 ms. Remains 197 /596 variables (removed 399) and now considering 151/517 (removed 366) transitions.
// Phase 1: matrix 151 rows 197 cols
[2023-03-11 03:01:28] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-11 03:01:28] [INFO ] Implicit Places using invariants in 127 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 56, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 129 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/596 places, 151/517 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 170/596 places, 151/517 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s39 0), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-13 finished in 283 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 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 287 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 589 transition count 437
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 146 place count 517 transition count 314
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 417 place count 369 transition count 314
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 429 place count 357 transition count 302
Iterating global reduction 2 with 12 rules applied. Total rules applied 441 place count 357 transition count 302
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 441 place count 357 transition count 300
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 446 place count 354 transition count 300
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 758 place count 196 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 760 place count 195 transition count 149
Applied a total of 760 rules in 39 ms. Remains 195 /596 variables (removed 401) and now considering 149/517 (removed 368) transitions.
// Phase 1: matrix 149 rows 195 cols
[2023-03-11 03:01:28] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-11 03:01:29] [INFO ] Implicit Places using invariants in 132 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 135 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/596 places, 149/517 transitions.
Applied a total of 0 rules in 4 ms. Remains 167 /167 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 167/596 places, 149/517 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s128 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 21578 reset in 358 ms.
Product exploration explored 100000 steps with 21533 reset in 348 ms.
Computed a total of 144 stabilizing places and 131 stable transitions
Computed a total of 144 stabilizing places and 131 stable transitions
Detected a total of 144/167 stabilizing places and 131/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2434 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 735 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 174 steps, run visited all 1 properties in 6 ms. (steps per millisecond=29 )
Probabilistic random walk after 174 steps, saw 111 distinct states, run finished after 6 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 149/149 transitions.
Applied a total of 0 rules in 6 ms. Remains 167 /167 variables (removed 0) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 167 cols
[2023-03-11 03:01:30] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-11 03:01:30] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-11 03:01:30] [INFO ] Invariant cache hit.
[2023-03-11 03:01:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:01:30] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [1, 3, 5, 10, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 59, 74, 76, 80, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 414 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/167 places, 149/149 transitions.
Graph (complete) has 424 edges and 133 vertex of which 122 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 122 transition count 131
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 109 transition count 131
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 40 place count 96 transition count 90
Iterating global reduction 2 with 13 rules applied. Total rules applied 53 place count 96 transition count 90
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 96 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 93 transition count 87
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 62 place count 90 transition count 84
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 90 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 68 place count 90 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 89 transition count 81
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 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 84 place count 81 transition count 74
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 6 with 2 rules applied. Total rules applied 86 place count 80 transition count 73
Applied a total of 86 rules in 21 ms. Remains 80 /133 variables (removed 53) and now considering 73/149 (removed 76) transitions.
// Phase 1: matrix 73 rows 80 cols
[2023-03-11 03:01:30] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-11 03:01:30] [INFO ] Implicit Places using invariants in 74 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/167 places, 73/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 520 ms. Remains : 77/167 places, 73/149 transitions.
Computed a total of 54 stabilizing places and 55 stable transitions
Computed a total of 54 stabilizing places and 55 stable transitions
Detected a total of 54/77 stabilizing places and 55/73 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2464 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 752 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 132 steps, run visited all 1 properties in 4 ms. (steps per millisecond=33 )
Probabilistic random walk after 132 steps, saw 83 distinct states, run finished after 4 ms. (steps per millisecond=33 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21844 reset in 138 ms.
Product exploration explored 100000 steps with 21966 reset in 125 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 77 cols
[2023-03-11 03:01:31] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-11 03:01:31] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-11 03:01:31] [INFO ] Invariant cache hit.
[2023-03-11 03:01:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 03:01:31] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [31, 34, 36]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 196 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/77 places, 73/73 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 74 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 71 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 70 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 70 transition count 69
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 2 with 23 rules applied. Total rules applied 31 place count 56 transition count 60
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 54 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 54 transition count 58
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 2 with 2 rules applied. Total rules applied 37 place count 53 transition count 57
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 53 transition count 55
Applied a total of 39 rules in 11 ms. Remains 53 /74 variables (removed 21) and now considering 55/73 (removed 18) transitions.
// Phase 1: matrix 55 rows 53 cols
[2023-03-11 03:01:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 03:01:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 03:01:31] [INFO ] Invariant cache hit.
[2023-03-11 03:01:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 03:01:31] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/77 places, 55/73 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 53/77 places, 55/73 transitions.
Treatment of property BusinessProcesses-PT-19-LTLFireability-14 finished in 3181 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) U X((X(X(G(!p1)))||(p2 U p1)))))'
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 584 transition count 505
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 580 transition count 501
Applied a total of 32 rules in 84 ms. Remains 580 /596 variables (removed 16) and now considering 501/517 (removed 16) transitions.
// Phase 1: matrix 501 rows 580 cols
[2023-03-11 03:01:32] [INFO ] Computed 117 place invariants in 5 ms
[2023-03-11 03:01:32] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-11 03:01:32] [INFO ] Invariant cache hit.
[2023-03-11 03:01:33] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2023-03-11 03:01:33] [INFO ] Invariant cache hit.
[2023-03-11 03:01:33] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/596 places, 501/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1418 ms. Remains : 580/596 places, 501/517 transitions.
Stuttering acceptance computed with spot in 282 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s378 1) (EQ s487 1)), p1:(AND (EQ s127 1) (EQ s405 1) (EQ s545 1)), p2:(EQ s487 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]]
Product exploration explored 100000 steps with 553 reset in 248 ms.
Product exploration explored 100000 steps with 547 reset in 238 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 564 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 892628 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 892628 steps, saw 134715 distinct states, run finished after 3002 ms. (steps per millisecond=297 ) properties seen :5
Running SMT prover for 1 properties.
[2023-03-11 03:01:38] [INFO ] Invariant cache hit.
[2023-03-11 03:01:38] [INFO ] [Real]Absence check using 70 positive place invariants in 20 ms returned sat
[2023-03-11 03:01:38] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-11 03:01:38] [INFO ] After 187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 476 ms
[2023-03-11 03:01:39] [INFO ] After 684ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:01:39] [INFO ] After 822ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:01:39] [INFO ] [Nat]Absence check using 70 positive place invariants in 24 ms returned sat
[2023-03-11 03:01:39] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-11 03:01:39] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 1 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 1 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 1 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2023-03-11 03:01:41] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 1 ms to minimize.
[2023-03-11 03:01:41] [INFO ] Deduced a trap composed of 104 places in 175 ms of which 0 ms to minimize.
[2023-03-11 03:01:41] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 1 ms to minimize.
[2023-03-11 03:01:41] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 0 ms to minimize.
[2023-03-11 03:01:41] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 0 ms to minimize.
[2023-03-11 03:01:42] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 1 ms to minimize.
[2023-03-11 03:01:42] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 0 ms to minimize.
[2023-03-11 03:01:42] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 1 ms to minimize.
[2023-03-11 03:01:42] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 1 ms to minimize.
[2023-03-11 03:01:42] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 0 ms to minimize.
[2023-03-11 03:01:43] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 1 ms to minimize.
[2023-03-11 03:01:43] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 1 ms to minimize.
[2023-03-11 03:01:43] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2023-03-11 03:01:43] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 1 ms to minimize.
[2023-03-11 03:01:43] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 1 ms to minimize.
[2023-03-11 03:01:43] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 0 ms to minimize.
[2023-03-11 03:01:44] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 1 ms to minimize.
[2023-03-11 03:01:44] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 0 ms to minimize.
[2023-03-11 03:01:44] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2023-03-11 03:01:44] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 1 ms to minimize.
[2023-03-11 03:01:44] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2023-03-11 03:01:44] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4882 ms
[2023-03-11 03:01:44] [INFO ] After 5157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-11 03:01:44] [INFO ] After 5384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 269 edges and 580 vertex of which 6 / 580 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 1289 edges and 575 vertex of which 574 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 510 transition count 306
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 401 place count 362 transition count 306
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 323 rules applied. Total rules applied 724 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 726 place count 197 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 197 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 730 place count 195 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 731 place count 195 transition count 148
Applied a total of 731 rules in 75 ms. Remains 195 /580 variables (removed 385) and now considering 148/501 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 195/580 places, 148/501 transitions.
Incomplete random walk after 10000 steps, including 460 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Finished Best-First random walk after 217 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=217 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 12 factoid took 697 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 345 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 18 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-11 03:01:46] [INFO ] Invariant cache hit.
[2023-03-11 03:01:46] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-11 03:01:46] [INFO ] Invariant cache hit.
[2023-03-11 03:01:47] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2023-03-11 03:01:47] [INFO ] Invariant cache hit.
[2023-03-11 03:01:47] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1336 ms. Remains : 580/580 places, 501/501 transitions.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 586 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 53 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:01:49] [INFO ] Invariant cache hit.
[2023-03-11 03:01:49] [INFO ] [Real]Absence check using 70 positive place invariants in 22 ms returned sat
[2023-03-11 03:01:49] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-11 03:01:49] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:01:49] [INFO ] [Nat]Absence check using 70 positive place invariants in 36 ms returned sat
[2023-03-11 03:01:49] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 35 ms returned sat
[2023-03-11 03:01:50] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:01:50] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2023-03-11 03:01:50] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-11 03:01:51] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-11 03:01:51] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2023-03-11 03:01:51] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 0 ms to minimize.
[2023-03-11 03:01:51] [INFO ] Deduced a trap composed of 96 places in 167 ms of which 1 ms to minimize.
[2023-03-11 03:01:51] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2023-03-11 03:01:51] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 0 ms to minimize.
[2023-03-11 03:01:52] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 1 ms to minimize.
[2023-03-11 03:01:52] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2023-03-11 03:01:52] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 1 ms to minimize.
[2023-03-11 03:01:52] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2023-03-11 03:01:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2127 ms
[2023-03-11 03:01:52] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-11 03:01:52] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2023-03-11 03:01:53] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-11 03:01:53] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2023-03-11 03:01:53] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2023-03-11 03:01:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 690 ms
[2023-03-11 03:01:53] [INFO ] After 3574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-11 03:01:53] [INFO ] After 4041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (complete) has 1296 edges and 580 vertex of which 579 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
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 579 transition count 437
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 516 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 514 transition count 435
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 131 place count 514 transition count 311
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 404 place count 365 transition count 311
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 323 rules applied. Total rules applied 727 place count 201 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 728 place count 201 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 730 place count 200 transition count 154
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 736 place count 200 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 199 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 198 transition count 153
Applied a total of 738 rules in 63 ms. Remains 198 /580 variables (removed 382) and now considering 153/501 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 198/580 places, 153/501 transitions.
Incomplete random walk after 10000 steps, including 1079 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 261 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Finished probabilistic random walk after 12879 steps, run visited all 4 properties in 65 ms. (steps per millisecond=198 )
Probabilistic random walk after 12879 steps, saw 4616 distinct states, run finished after 66 ms. (steps per millisecond=195 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 12 factoid took 767 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 319 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 335 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 554 reset in 249 ms.
Product exploration explored 100000 steps with 556 reset in 272 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 250 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (complete) has 1296 edges and 580 vertex of which 579 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 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 579 transition count 500
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 579 transition count 566
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 579 transition count 566
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 557 transition count 525
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 557 transition count 525
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 323 places in 1 ms
Iterating global reduction 1 with 193 rules applied. Total rules applied 390 place count 557 transition count 525
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 436 place count 511 transition count 479
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 482 place count 511 transition count 479
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 485 place count 511 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 486 place count 511 transition count 490
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 489 place count 508 transition count 484
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 492 place count 508 transition count 484
Deduced a syphon composed of 277 places in 0 ms
Applied a total of 492 rules in 118 ms. Remains 508 /580 variables (removed 72) and now considering 484/501 (removed 17) transitions.
[2023-03-11 03:01:57] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 484 rows 508 cols
[2023-03-11 03:01:57] [INFO ] Computed 117 place invariants in 8 ms
[2023-03-11 03:01:57] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/580 places, 484/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 648 ms. Remains : 508/580 places, 484/501 transitions.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 14 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 580 cols
[2023-03-11 03:01:57] [INFO ] Computed 117 place invariants in 4 ms
[2023-03-11 03:01:57] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-11 03:01:57] [INFO ] Invariant cache hit.
[2023-03-11 03:01:58] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-11 03:01:58] [INFO ] Invariant cache hit.
[2023-03-11 03:01:58] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 580/580 places, 501/501 transitions.
Treatment of property BusinessProcesses-PT-19-LTLFireability-15 finished in 26535 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)))'
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) U X((X(X(G(!p1)))||(p2 U p1)))))'
[2023-03-11 03:01:58] [INFO ] Flatten gal took : 56 ms
[2023-03-11 03:01:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 03:01:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 596 places, 517 transitions and 1634 arcs took 6 ms.
Total runtime 46485 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-19
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA BusinessProcesses-PT-19-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503720607

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-19-LTLFireability-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-19-LTLFireability-14
lola: result : true
lola: markings : 291745
lola: fired transitions : 547154
lola: time used : 1.000000
lola: memory pages used : 2
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-19-LTLFireability-15
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-19-LTLFireability-15
lola: result : false
lola: markings : 429
lola: fired transitions : 454
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-19-LTLFireability-14: LTL true LTL model checker
BusinessProcesses-PT-19-LTLFireability-15: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-19, 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 r039-tajo-167813692700596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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