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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:43 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 59K 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-02-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678500867484

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-02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:14:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:14:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:14:32] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-11 02:14:33] [INFO ] Transformed 262 places.
[2023-03-11 02:14:33] [INFO ] Transformed 219 transitions.
[2023-03-11 02:14:33] [INFO ] Found NUPN structural information;
[2023-03-11 02:14:33] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 29 place count 216 transition count 181
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 216 transition count 181
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 206 transition count 171
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 206 transition count 171
Applied a total of 72 rules in 159 ms. Remains 206 /245 variables (removed 39) and now considering 171/204 (removed 33) transitions.
// Phase 1: matrix 171 rows 206 cols
[2023-03-11 02:14:33] [INFO ] Computed 37 place invariants in 23 ms
[2023-03-11 02:14:34] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-11 02:14:34] [INFO ] Invariant cache hit.
[2023-03-11 02:14:34] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-03-11 02:14:34] [INFO ] Invariant cache hit.
[2023-03-11 02:14:35] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/245 places, 171/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2128 ms. Remains : 206/245 places, 171/204 transitions.
Support contains 40 out of 206 places after structural reductions.
[2023-03-11 02:14:36] [INFO ] Flatten gal took : 106 ms
[2023-03-11 02:14:36] [INFO ] Flatten gal took : 52 ms
[2023-03-11 02:14:36] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 39 out of 206 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 02:14:37] [INFO ] Invariant cache hit.
[2023-03-11 02:14:38] [INFO ] [Real]Absence check using 28 positive place invariants in 155 ms returned sat
[2023-03-11 02:14:38] [INFO ] [Real]Absence check using 28 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-11 02:14:38] [INFO ] After 825ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-11 02:14:39] [INFO ] [Nat]Absence check using 28 positive place invariants in 148 ms returned sat
[2023-03-11 02:14:39] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 47 ms returned sat
[2023-03-11 02:14:40] [INFO ] After 1339ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-11 02:14:41] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 4 ms to minimize.
[2023-03-11 02:14:41] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 9 ms to minimize.
[2023-03-11 02:14:41] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 11 ms to minimize.
[2023-03-11 02:14:41] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 10 ms to minimize.
[2023-03-11 02:14:41] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2023-03-11 02:14:42] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:14:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1202 ms
[2023-03-11 02:14:42] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 0 ms to minimize.
[2023-03-11 02:14:44] [INFO ] Deduced a trap composed of 28 places in 1796 ms of which 26 ms to minimize.
[2023-03-11 02:14:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2120 ms
[2023-03-11 02:14:44] [INFO ] After 4977ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-11 02:14:44] [INFO ] After 6043ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 15 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (complete) has 401 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 203 transition count 143
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 179 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 177 transition count 141
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 54 place count 177 transition count 106
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 128 place count 138 transition count 106
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 135 place count 131 transition count 99
Iterating global reduction 3 with 7 rules applied. Total rules applied 142 place count 131 transition count 99
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 238 place count 82 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 82 transition count 51
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 82 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 81 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 243 place count 80 transition count 50
Applied a total of 243 rules in 112 ms. Remains 80 /206 variables (removed 126) and now considering 50/171 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 80/206 places, 50/171 transitions.
Incomplete random walk after 10000 steps, including 1019 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 347 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 334 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 50 rows 80 cols
[2023-03-11 02:14:45] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-11 02:14:45] [INFO ] [Real]Absence check using 24 positive place invariants in 135 ms returned sat
[2023-03-11 02:14:45] [INFO ] [Real]Absence check using 24 positive and 7 generalized place invariants in 40 ms returned sat
[2023-03-11 02:14:46] [INFO ] After 611ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 02:14:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-11 02:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-11 02:14:46] [INFO ] After 759ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:14:46] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:14:46] [INFO ] [Nat]Absence check using 24 positive place invariants in 4 ms returned sat
[2023-03-11 02:14:46] [INFO ] [Nat]Absence check using 24 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-11 02:14:46] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:14:46] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-11 02:14:46] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-11 02:14:46] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 50/50 transitions.
Graph (trivial) has 16 edges and 80 vertex of which 2 / 80 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 place count 79 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 76 transition count 45
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 7 place count 76 transition count 40
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 20 place count 68 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 67 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 67 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 63 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 63 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 62 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 61 transition count 33
Applied a total of 33 rules in 30 ms. Remains 61 /80 variables (removed 19) and now considering 33/50 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 61/80 places, 33/50 transitions.
Finished random walk after 81 steps, including 3 resets, run visited all 2 properties in 15 ms. (steps per millisecond=5 )
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 198 stabilizing places and 161 stable transitions
Graph (complete) has 401 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (trivial) has 105 edges and 206 vertex of which 7 / 206 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 394 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 196 transition count 130
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 166 transition count 130
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 62 place count 166 transition count 92
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 146 place count 120 transition count 92
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 156 place count 110 transition count 82
Iterating global reduction 2 with 10 rules applied. Total rules applied 166 place count 110 transition count 82
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 258 place count 63 transition count 37
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 260 place count 62 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 61 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 60 transition count 35
Applied a total of 262 rules in 63 ms. Remains 60 /206 variables (removed 146) and now considering 35/171 (removed 136) transitions.
// Phase 1: matrix 35 rows 60 cols
[2023-03-11 02:14:47] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-11 02:14:47] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-11 02:14:47] [INFO ] Invariant cache hit.
[2023-03-11 02:14:47] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 16, 18, 20, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 322 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/206 places, 35/171 transitions.
Graph (complete) has 67 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 33 transition count 28
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 27 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 22 transition count 24
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 24 place count 21 transition count 23
Applied a total of 24 rules in 2 ms. Remains 21 /35 variables (removed 14) and now considering 23/35 (removed 12) transitions.
// Phase 1: matrix 23 rows 21 cols
[2023-03-11 02:14:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 02:14:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 02:14:48] [INFO ] Invariant cache hit.
[2023-03-11 02:14:48] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/206 places, 23/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1269 ms. Remains : 21/206 places, 23/171 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s18 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-00 finished in 1911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 194 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 194 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 188 transition count 153
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 188 transition count 153
Applied a total of 36 rules in 9 ms. Remains 188 /206 variables (removed 18) and now considering 153/171 (removed 18) transitions.
// Phase 1: matrix 153 rows 188 cols
[2023-03-11 02:14:49] [INFO ] Computed 37 place invariants in 6 ms
[2023-03-11 02:14:51] [INFO ] Implicit Places using invariants in 2372 ms returned []
[2023-03-11 02:14:51] [INFO ] Invariant cache hit.
[2023-03-11 02:14:52] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
[2023-03-11 02:14:52] [INFO ] Invariant cache hit.
[2023-03-11 02:14:52] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/206 places, 153/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3729 ms. Remains : 188/206 places, 153/171 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s52 1) (EQ s151 1) (EQ s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-01 finished in 3952 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||(p1&&F(p2))))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (trivial) has 102 edges and 206 vertex of which 4 / 206 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 398 edges and 203 vertex of which 200 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 199 transition count 134
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 169 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 168 transition count 133
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 64 place count 168 transition count 96
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 146 place count 123 transition count 96
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 155 place count 114 transition count 87
Iterating global reduction 3 with 9 rules applied. Total rules applied 164 place count 114 transition count 87
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 260 place count 65 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 63 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 62 transition count 38
Applied a total of 264 rules in 52 ms. Remains 62 /206 variables (removed 144) and now considering 38/171 (removed 133) transitions.
// Phase 1: matrix 38 rows 62 cols
[2023-03-11 02:14:53] [INFO ] Computed 26 place invariants in 25 ms
[2023-03-11 02:14:53] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-11 02:14:53] [INFO ] Invariant cache hit.
[2023-03-11 02:14:53] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 38, 40, 42]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 392 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/206 places, 38/171 transitions.
Graph (complete) has 74 edges and 38 vertex of which 36 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 36 transition count 32
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 31 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 29 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 29 transition count 30
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 25 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 25 transition count 25
Applied a total of 24 rules in 23 ms. Remains 25 /38 variables (removed 13) and now considering 25/38 (removed 13) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-11 02:14:53] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:14:54] [INFO ] Implicit Places using invariants in 798 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 809 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/206 places, 25/171 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 24
Applied a total of 2 rules in 3 ms. Remains 23 /24 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-11 02:14:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:14:54] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-11 02:14:54] [INFO ] Invariant cache hit.
[2023-03-11 02:14:55] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 23/206 places, 24/171 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2134 ms. Remains : 23/206 places, 24/171 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s17 1), p0:(EQ s12 1), p2:(EQ s19 0)], 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]]
Product exploration explored 100000 steps with 15595 reset in 446 ms.
Product exploration explored 100000 steps with 15589 reset in 342 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Computed a total of 19 stabilizing places and 18 stable transitions
Detected a total of 19/23 stabilizing places and 18/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 1004 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 337 steps, including 57 resets, run visited all 3 properties in 2 ms. (steps per millisecond=168 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 8 factoid took 878 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-11 02:14:59] [INFO ] Invariant cache hit.
[2023-03-11 02:14:59] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 02:14:59] [INFO ] Invariant cache hit.
[2023-03-11 02:14:59] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-11 02:14:59] [INFO ] Redundant transitions in 333 ms returned []
[2023-03-11 02:14:59] [INFO ] Invariant cache hit.
[2023-03-11 02:14:59] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 593 ms. Remains : 23/23 places, 24/24 transitions.
Computed a total of 19 stabilizing places and 18 stable transitions
Computed a total of 19 stabilizing places and 18 stable transitions
Detected a total of 19/23 stabilizing places and 18/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 761 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 757 steps, including 121 resets, run visited all 3 properties in 2 ms. (steps per millisecond=378 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 8 factoid took 902 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 15624 reset in 275 ms.
Product exploration explored 100000 steps with 15636 reset in 345 ms.
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-11 02:15:02] [INFO ] Invariant cache hit.
[2023-03-11 02:15:03] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-11 02:15:03] [INFO ] Invariant cache hit.
[2023-03-11 02:15:03] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-11 02:15:03] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-11 02:15:03] [INFO ] Invariant cache hit.
[2023-03-11 02:15:04] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1280 ms. Remains : 23/23 places, 24/24 transitions.
Treatment of property BusinessProcesses-PT-02-LTLFireability-04 finished in 11280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 195 transition count 160
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 195 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 190 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 190 transition count 155
Applied a total of 32 rules in 13 ms. Remains 190 /206 variables (removed 16) and now considering 155/171 (removed 16) transitions.
// Phase 1: matrix 155 rows 190 cols
[2023-03-11 02:15:04] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-11 02:15:05] [INFO ] Implicit Places using invariants in 810 ms returned []
[2023-03-11 02:15:05] [INFO ] Invariant cache hit.
[2023-03-11 02:15:05] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
[2023-03-11 02:15:05] [INFO ] Invariant cache hit.
[2023-03-11 02:15:05] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/206 places, 155/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1227 ms. Remains : 190/206 places, 155/171 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s95 1), p0:(OR (EQ s27 1) (AND (EQ s29 1) (EQ s129 1) (EQ s169 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-05 finished in 1387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (trivial) has 109 edges and 206 vertex of which 7 / 206 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 394 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 196 transition count 128
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 164 transition count 128
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 66 place count 164 transition count 90
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 150 place count 118 transition count 90
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 161 place count 107 transition count 79
Iterating global reduction 2 with 11 rules applied. Total rules applied 172 place count 107 transition count 79
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 262 place count 61 transition count 35
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 264 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 58 transition count 33
Applied a total of 266 rules in 46 ms. Remains 58 /206 variables (removed 148) and now considering 33/171 (removed 138) transitions.
// Phase 1: matrix 33 rows 58 cols
[2023-03-11 02:15:05] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-11 02:15:05] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 02:15:05] [INFO ] Invariant cache hit.
[2023-03-11 02:15:06] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 30, 32, 34, 36, 38, 40, 42]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 353 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/206 places, 33/171 transitions.
Graph (complete) has 92 edges and 40 vertex of which 38 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 4 place count 38 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 35 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 12 place count 32 transition count 27
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 14 place count 31 transition count 26
Applied a total of 14 rules in 2 ms. Remains 31 /40 variables (removed 9) and now considering 26/33 (removed 7) transitions.
// Phase 1: matrix 26 rows 31 cols
[2023-03-11 02:15:06] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 02:15:06] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 02:15:06] [INFO ] Invariant cache hit.
[2023-03-11 02:15:06] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/206 places, 26/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 563 ms. Remains : 31/206 places, 26/171 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 3 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-08 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&F(p2)))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (complete) has 401 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 202 transition count 140
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 175 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 173 transition count 138
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 59 place count 173 transition count 95
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 153 place count 122 transition count 95
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 165 place count 110 transition count 83
Iterating global reduction 3 with 12 rules applied. Total rules applied 177 place count 110 transition count 83
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 271 place count 62 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 62 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 273 place count 61 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 60 transition count 35
Applied a total of 274 rules in 20 ms. Remains 60 /206 variables (removed 146) and now considering 35/171 (removed 136) transitions.
// Phase 1: matrix 35 rows 60 cols
[2023-03-11 02:15:06] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-11 02:15:06] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-11 02:15:06] [INFO ] Invariant cache hit.
[2023-03-11 02:15:06] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [19, 21, 23, 24, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 226 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/206 places, 35/171 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 46 transition count 30
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 41 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 38 transition count 27
Applied a total of 16 rules in 2 ms. Remains 38 /46 variables (removed 8) and now considering 27/35 (removed 8) transitions.
// Phase 1: matrix 27 rows 38 cols
[2023-03-11 02:15:06] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-11 02:15:06] [INFO ] Implicit Places using invariants in 69 ms returned [10, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 102 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/206 places, 27/171 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 25
Applied a total of 4 rules in 1 ms. Remains 34 /36 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 34 cols
[2023-03-11 02:15:06] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-11 02:15:07] [INFO ] Implicit Places using invariants in 890 ms returned []
[2023-03-11 02:15:07] [INFO ] Invariant cache hit.
[2023-03-11 02:15:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 02:15:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [1, 2, 3, 9, 11, 12, 13]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 999 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 27/206 places, 25/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 25 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 23
Applied a total of 4 rules in 1 ms. Remains 25 /27 variables (removed 2) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 25 cols
[2023-03-11 02:15:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 02:15:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-11 02:15:07] [INFO ] Invariant cache hit.
[2023-03-11 02:15:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 02:15:07] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 25/206 places, 23/171 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1455 ms. Remains : 25/206 places, 23/171 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s7 1) (EQ s17 1) (EQ s23 1)), p1:(OR (AND (EQ s7 1) (EQ s17 1) (EQ s23 1)) (AND (EQ s2 1) (EQ s14 1) (EQ s23 1))), p0:(AND (EQ s2 1) (EQ s14 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-09 finished in 1733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(F(p1))&&G(p2))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 196 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 196 transition count 161
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 191 transition count 156
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 191 transition count 156
Applied a total of 30 rules in 15 ms. Remains 191 /206 variables (removed 15) and now considering 156/171 (removed 15) transitions.
// Phase 1: matrix 156 rows 191 cols
[2023-03-11 02:15:08] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-11 02:15:08] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-11 02:15:08] [INFO ] Invariant cache hit.
[2023-03-11 02:15:08] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-11 02:15:08] [INFO ] Invariant cache hit.
[2023-03-11 02:15:14] [INFO ] Dead Transitions using invariants and state equation in 5953 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/206 places, 156/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6500 ms. Remains : 191/206 places, 156/171 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 2}]], initial=5, aps=[p2:(EQ s182 1), p0:(EQ s107 1), p1:(EQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-10 finished in 6928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 196 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 196 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 190 transition count 155
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 190 transition count 155
Applied a total of 32 rules in 18 ms. Remains 190 /206 variables (removed 16) and now considering 155/171 (removed 16) transitions.
// Phase 1: matrix 155 rows 190 cols
[2023-03-11 02:15:15] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-11 02:15:15] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-11 02:15:15] [INFO ] Invariant cache hit.
[2023-03-11 02:15:15] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-11 02:15:15] [INFO ] Invariant cache hit.
[2023-03-11 02:15:15] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/206 places, 155/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 755 ms. Remains : 190/206 places, 155/171 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s166 1), p0:(EQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-11 finished in 1098 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((G((p0||X(p1)))||X(G(p2))))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 195 transition count 160
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 195 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 189 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 189 transition count 154
Applied a total of 34 rules in 4 ms. Remains 189 /206 variables (removed 17) and now considering 154/171 (removed 17) transitions.
// Phase 1: matrix 154 rows 189 cols
[2023-03-11 02:15:16] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 02:15:16] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-11 02:15:16] [INFO ] Invariant cache hit.
[2023-03-11 02:15:16] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-11 02:15:16] [INFO ] Invariant cache hit.
[2023-03-11 02:15:17] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/206 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 695 ms. Remains : 189/206 places, 154/171 transitions.
Stuttering acceptance computed with spot in 587 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 3}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=6, aps=[p1:(EQ s65 0), p0:(EQ s96 1), p2:(EQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13175 steps with 179 reset in 70 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-12 finished in 1406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X(p2)&&p1))))'
Support contains 8 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 195 transition count 160
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 195 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 189 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 189 transition count 154
Applied a total of 34 rules in 4 ms. Remains 189 /206 variables (removed 17) and now considering 154/171 (removed 17) transitions.
// Phase 1: matrix 154 rows 189 cols
[2023-03-11 02:15:17] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-11 02:15:17] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-11 02:15:17] [INFO ] Invariant cache hit.
[2023-03-11 02:15:18] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-11 02:15:18] [INFO ] Invariant cache hit.
[2023-03-11 02:15:18] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/206 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 189/206 places, 154/171 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), 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=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s126 0) (EQ s182 0)), p2:(OR (EQ s39 0) (EQ s150 0) (EQ s182 0)), p1:(AND (EQ s157 1) (EQ s99 1) (EQ s144 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Product exploration explored 100000 steps with 50000 reset in 478 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLFireability-13 finished in 2024 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)) U (p1||G(p2))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (trivial) has 105 edges and 206 vertex of which 7 / 206 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 394 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 196 transition count 130
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 166 transition count 130
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 62 place count 166 transition count 93
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 143 place count 122 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 153 place count 112 transition count 83
Iterating global reduction 2 with 10 rules applied. Total rules applied 163 place count 112 transition count 83
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 253 place count 67 transition count 38
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 255 place count 66 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 256 place count 65 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 64 transition count 36
Applied a total of 257 rules in 15 ms. Remains 64 /206 variables (removed 142) and now considering 36/171 (removed 135) transitions.
// Phase 1: matrix 36 rows 64 cols
[2023-03-11 02:15:19] [INFO ] Computed 29 place invariants in 0 ms
[2023-03-11 02:15:19] [INFO ] Implicit Places using invariants in 155 ms returned [4, 60, 62]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 166 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/206 places, 36/171 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 61/206 places, 36/171 transitions.
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s51 1), p2:(EQ s2 1), p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-15 finished in 587 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||(p1&&F(p2))))))'
[2023-03-11 02:15:20] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:15:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 02:15:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 171 transitions and 475 arcs took 7 ms.
Total runtime 48205 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-02
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA BusinessProcesses-PT-02-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678500921291

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-02-LTLFireability-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-02-LTLFireability-04
lola: result : true
lola: markings : 218
lola: fired transitions : 370
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-02-LTLFireability-04: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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

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