Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918400332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 59K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-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 1652623063664

Running Version 202205111006
[2022-05-15 13:57:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 13:57:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:57:45] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2022-05-15 13:57:45] [INFO ] Transformed 262 places.
[2022-05-15 13:57:45] [INFO ] Transformed 219 transitions.
[2022-05-15 13:57:45] [INFO ] Found NUPN structural information;
[2022-05-15 13:57:45] [INFO ] Parsed PT model containing 262 places and 219 transitions in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 17 places in 2 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-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 32 place count 213 transition count 178
Iterating global reduction 1 with 26 rules applied. Total rules applied 58 place count 213 transition count 178
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 71 place count 200 transition count 165
Iterating global reduction 1 with 13 rules applied. Total rules applied 84 place count 200 transition count 165
Applied a total of 84 rules in 59 ms. Remains 200 /245 variables (removed 45) and now considering 165/204 (removed 39) transitions.
// Phase 1: matrix 165 rows 200 cols
[2022-05-15 13:57:45] [INFO ] Computed 37 place invariants in 18 ms
[2022-05-15 13:57:45] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 165 rows 200 cols
[2022-05-15 13:57:45] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 13:57:45] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
// Phase 1: matrix 165 rows 200 cols
[2022-05-15 13:57:45] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-15 13:57:45] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 200/245 places, 165/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/245 places, 165/204 transitions.
Support contains 28 out of 200 places after structural reductions.
[2022-05-15 13:57:45] [INFO ] Flatten gal took : 39 ms
[2022-05-15 13:57:45] [INFO ] Flatten gal took : 16 ms
[2022-05-15 13:57:46] [INFO ] Input system was already deterministic with 165 transitions.
Support contains 27 out of 200 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 25) seen :17
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 165 rows 200 cols
[2022-05-15 13:57:46] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:47] [INFO ] [Real]Absence check using 28 positive place invariants in 6 ms returned sat
[2022-05-15 13:57:47] [INFO ] [Real]Absence check using 28 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 13:57:47] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-15 13:57:47] [INFO ] [Nat]Absence check using 28 positive place invariants in 8 ms returned sat
[2022-05-15 13:57:47] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-15 13:57:47] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-15 13:57:47] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 4 ms to minimize.
[2022-05-15 13:57:47] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2022-05-15 13:57:47] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2022-05-15 13:57:47] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2022-05-15 13:57:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 320 ms
[2022-05-15 13:57:48] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2022-05-15 13:57:48] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-15 13:57:48] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2022-05-15 13:57:48] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2022-05-15 13:57:48] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2022-05-15 13:57:48] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2022-05-15 13:57:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 282 ms
[2022-05-15 13:57:48] [INFO ] After 909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-15 13:57:48] [INFO ] After 1260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 11 out of 200 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 200/200 places, 165/165 transitions.
Graph (complete) has 390 edges and 200 vertex of which 195 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 195 transition count 136
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 172 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 170 transition count 134
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 52 place count 170 transition count 96
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 83 rules applied. Total rules applied 135 place count 125 transition count 96
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 121 transition count 92
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 121 transition count 92
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 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 239 place count 72 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 72 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 241 place count 72 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 71 transition count 43
Applied a total of 242 rules in 46 ms. Remains 71 /200 variables (removed 129) and now considering 43/165 (removed 122) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/200 places, 43/165 transitions.
Incomplete random walk after 10000 steps, including 1026 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 354 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 370 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 356 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 363 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 318 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 388 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 371 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 43 rows 71 cols
[2022-05-15 13:57:49] [INFO ] Computed 29 place invariants in 4 ms
[2022-05-15 13:57:49] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2022-05-15 13:57:49] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 13:57:49] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-15 13:57:49] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2022-05-15 13:57:49] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-15 13:57:49] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-15 13:57:49] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2022-05-15 13:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-15 13:57:49] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 13:57:49] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 14 ms.
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 71/71 places, 43/43 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 69 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 69 transition count 39
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 9 place count 66 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 11 place count 65 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 65 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 64 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 64 transition count 37
Applied a total of 14 rules in 9 ms. Remains 64 /71 variables (removed 7) and now considering 37/43 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/71 places, 37/43 transitions.
Finished random walk after 4941 steps, including 532 resets, run visited all 4 properties in 82 ms. (steps per millisecond=60 )
FORMULA BusinessProcesses-PT-02-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-02-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 155 stable transitions
Graph (complete) has 390 edges and 200 vertex of which 195 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(!F(G(p0)))) U !(!G(p1)&&p2)))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 192 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 192 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 189 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 189 transition count 154
Applied a total of 22 rules in 24 ms. Remains 189 /200 variables (removed 11) and now considering 154/165 (removed 11) transitions.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:50] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:50] [INFO ] Implicit Places using invariants in 430 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:50] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:50] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:50] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:50] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/200 places, 154/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/200 places, 154/165 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s50 1), p1:(EQ s41 1), p0:(EQ s163 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 259 ms.
Product exploration explored 100000 steps with 33333 reset in 178 ms.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 377 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) (NOT p0))
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-02-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLFireability-00 finished in 1847 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!F(G((F(p1)||!p0))))) U p2))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Graph (trivial) has 97 edges and 200 vertex of which 7 / 200 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 383 edges and 194 vertex of which 189 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 188 transition count 126
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 162 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 161 transition count 125
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 56 place count 161 transition count 87
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 140 place count 115 transition count 87
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 144 place count 111 transition count 83
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 111 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 242 place count 63 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 62 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 61 transition count 36
Applied a total of 244 rules in 30 ms. Remains 61 /200 variables (removed 139) and now considering 36/165 (removed 129) transitions.
// Phase 1: matrix 36 rows 61 cols
[2022-05-15 13:57:51] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:57:51] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 36 rows 61 cols
[2022-05-15 13:57:51] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [0, 1, 4, 5, 7, 9, 12, 13, 15, 16, 17, 19, 21, 23, 24, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 253 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/200 places, 36/165 transitions.
Graph (complete) has 67 edges and 36 vertex of which 34 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 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 34 transition count 30
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 29 transition count 30
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 27 transition count 28
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 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 24 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 26 place count 21 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 21 transition count 22
Applied a total of 27 rules in 6 ms. Remains 21 /36 variables (removed 15) and now considering 22/36 (removed 14) transitions.
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 13:57:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 13:57:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/200 places, 22/165 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/200 places, 22/165 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s4 1), p0:(EQ s0 1), p1:(EQ s18 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 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-01 finished in 544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Graph (trivial) has 102 edges and 200 vertex of which 7 / 200 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 383 edges and 194 vertex of which 189 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 188 transition count 123
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 159 transition count 123
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 60 place count 159 transition count 85
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 144 place count 113 transition count 85
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 107 transition count 79
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 107 transition count 79
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 248 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 249 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 250 place count 58 transition count 33
Applied a total of 250 rules in 25 ms. Remains 58 /200 variables (removed 142) and now considering 33/165 (removed 132) transitions.
// Phase 1: matrix 33 rows 58 cols
[2022-05-15 13:57:52] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 33 rows 58 cols
[2022-05-15 13:57:52] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [15, 16, 18, 20, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 116 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/200 places, 33/165 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 6 place count 42 transition count 27
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 36 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 35 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 35 transition count 26
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 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 29 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 27 transition count 20
Applied a total of 28 rules in 4 ms. Remains 27 /42 variables (removed 15) and now considering 20/33 (removed 13) transitions.
// Phase 1: matrix 20 rows 27 cols
[2022-05-15 13:57:52] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 20 rows 27 cols
[2022-05-15 13:57:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 13:57:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [2, 3, 4, 5, 7, 9, 11, 12]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 94 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/200 places, 20/165 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 18 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 18 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 18 transition count 18
Applied a total of 3 rules in 1 ms. Remains 18 /19 variables (removed 1) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 18 cols
[2022-05-15 13:57:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 18 rows 18 cols
[2022-05-15 13:57:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 13:57:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 18/200 places, 18/165 transitions.
Finished structural reductions, in 3 iterations. Remains : 18/200 places, 18/165 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 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-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-04 finished in 398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Graph (trivial) has 99 edges and 200 vertex of which 7 / 200 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 383 edges and 194 vertex of which 189 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 29 place count 188 transition count 125
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 161 transition count 125
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 56 place count 161 transition count 87
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 140 place count 115 transition count 87
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 110 transition count 82
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 110 transition count 82
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 242 place count 64 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 63 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 244 place count 62 transition count 35
Applied a total of 244 rules in 18 ms. Remains 62 /200 variables (removed 138) and now considering 35/165 (removed 130) transitions.
// Phase 1: matrix 35 rows 62 cols
[2022-05-15 13:57:52] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants in 39 ms returned [10, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/200 places, 35/165 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/200 places, 35/165 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 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 110 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 192 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 192 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 189 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 189 transition count 154
Applied a total of 22 rules in 12 ms. Remains 189 /200 variables (removed 11) and now considering 154/165 (removed 11) transitions.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:52] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:52] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:52] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-15 13:57:53] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:53] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-15 13:57:53] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/200 places, 154/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/200 places, 154/165 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s81 1), p1:(EQ s169 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][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-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-06 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F((X(G(F(p1)))||p2))) U p0))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 193 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 193 transition count 158
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 191 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 191 transition count 156
Applied a total of 18 rules in 11 ms. Remains 191 /200 variables (removed 9) and now considering 156/165 (removed 9) transitions.
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:57:53] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:53] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:57:53] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:53] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:57:53] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:53] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/200 places, 156/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/200 places, 156/165 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s158 1), p2:(EQ s100 1), p1:(EQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 163 steps with 3 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-07 finished in 530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||p1))||G(X(X(p2)))))'
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 192 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 192 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 189 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 189 transition count 154
Applied a total of 22 rules in 10 ms. Remains 189 /200 variables (removed 11) and now considering 154/165 (removed 11) transitions.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:53] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:53] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:53] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:54] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:54] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:54] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/200 places, 154/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/200 places, 154/165 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s160 1), p1:(EQ s12 1), p2:(EQ s103 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 3841 reset in 145 ms.
Product exploration explored 100000 steps with 3807 reset in 262 ms.
Computed a total of 182 stabilizing places and 145 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.1 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 241 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:55] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-15 13:57:55] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 13:57:55] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2022-05-15 13:57:55] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-15 13:57:55] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 13:57:55] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2022-05-15 13:57:55] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2022-05-15 13:57:55] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2022-05-15 13:57:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2022-05-15 13:57:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 242 ms
[2022-05-15 13:57:55] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-15 13:57:55] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 88 edges and 189 vertex of which 4 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 372 edges and 186 vertex of which 183 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 24 rules applied. Total rules applied 26 place count 183 transition count 122
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 159 transition count 122
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 50 place count 159 transition count 85
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 2 with 82 rules applied. Total rules applied 132 place count 114 transition count 85
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 232 place count 63 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 63 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 62 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 60 transition count 34
Applied a total of 237 rules in 12 ms. Remains 60 /189 variables (removed 129) and now considering 34/154 (removed 120) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/189 places, 34/154 transitions.
Finished random walk after 2032 steps, including 178 resets, run visited all 1 properties in 4 ms. (steps per millisecond=508 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 302 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:56] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 13:57:56] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:56] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:56] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:56] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:56] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 154/154 transitions.
Computed a total of 182 stabilizing places and 145 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.1 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:57:57] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:57] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 13:57:57] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2022-05-15 13:57:57] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-15 13:57:57] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 13:57:57] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2022-05-15 13:57:57] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-05-15 13:57:57] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2022-05-15 13:57:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2022-05-15 13:57:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 259 ms
[2022-05-15 13:57:57] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 13:57:57] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 88 edges and 189 vertex of which 4 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 372 edges and 186 vertex of which 183 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 24 rules applied. Total rules applied 26 place count 183 transition count 122
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 159 transition count 122
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 50 place count 159 transition count 85
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 2 with 82 rules applied. Total rules applied 132 place count 114 transition count 85
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 232 place count 63 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 63 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 62 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 235 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 60 transition count 34
Applied a total of 237 rules in 13 ms. Remains 60 /189 variables (removed 129) and now considering 34/154 (removed 120) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/189 places, 34/154 transitions.
Finished random walk after 2139 steps, including 178 resets, run visited all 1 properties in 4 ms. (steps per millisecond=534 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 5 factoid took 392 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3788 reset in 180 ms.
Product exploration explored 100000 steps with 3773 reset in 214 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 88 edges and 189 vertex of which 4 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 373 edges and 186 vertex of which 183 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
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 183 transition count 148
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 25 place count 183 transition count 170
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 55 place count 183 transition count 170
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 175 transition count 156
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 175 transition count 156
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 57 rules applied. Total rules applied 128 place count 175 transition count 156
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 145 place count 158 transition count 139
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 162 place count 158 transition count 139
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 162 rules in 25 ms. Remains 158 /189 variables (removed 31) and now considering 139/154 (removed 15) transitions.
[2022-05-15 13:57:59] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 139 rows 158 cols
[2022-05-15 13:57:59] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:59] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/189 places, 139/154 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/189 places, 139/154 transitions.
Product exploration explored 100000 steps with 16626 reset in 487 ms.
Product exploration explored 100000 steps with 16646 reset in 337 ms.
Built C files in :
/tmp/ltsmin13478660643987331394
[2022-05-15 13:58:00] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13478660643987331394
Running compilation step : cd /tmp/ltsmin13478660643987331394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 349 ms.
Running link step : cd /tmp/ltsmin13478660643987331394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13478660643987331394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7306555109375878928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 6 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:58:15] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:58:15] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:58:15] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:58:15] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:58:15] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:58:15] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 154/154 transitions.
Built C files in :
/tmp/ltsmin6190948829490667027
[2022-05-15 13:58:15] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6190948829490667027
Running compilation step : cd /tmp/ltsmin6190948829490667027;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 248 ms.
Running link step : cd /tmp/ltsmin6190948829490667027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6190948829490667027;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13148749625653594815.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 13:58:30] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:58:30] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:58:30] [INFO ] Time to serialize gal into /tmp/LTL4893145638534076242.gal : 2 ms
[2022-05-15 13:58:30] [INFO ] Time to serialize properties into /tmp/LTL2395576559905269013.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4893145638534076242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2395576559905269013.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4893145...266
Read 1 LTL properties
Checking formula 0 : !(((F((F("(p201==1)"))||("(p12==1)")))||(G(X(X("(p127==0)"))))))
Formula 0 simplified : !(F("(p12==1)" | F"(p201==1)") | GXX"(p127==0)")
Reverse transition relation is NOT exact ! Due to transitions t2, t23, t29, t33, t37, t40, t43, t46, t49, t52, t56, t59, t62, t71, t75, t76, t79, t82, t85,...343
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2022-05-15 13:58:45] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:58:45] [INFO ] Applying decomposition
[2022-05-15 13:58:45] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6508554323083024808.txt' '-o' '/tmp/graph6508554323083024808.bin' '-w' '/tmp/graph6508554323083024808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6508554323083024808.bin' '-l' '-1' '-v' '-w' '/tmp/graph6508554323083024808.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:58:47] [INFO ] Decomposing Gal with order
[2022-05-15 13:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:58:47] [INFO ] Removed a total of 33 redundant transitions.
[2022-05-15 13:58:47] [INFO ] Flatten gal took : 43 ms
[2022-05-15 13:58:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-15 13:58:47] [INFO ] Time to serialize gal into /tmp/LTL5827866527590302055.gal : 4 ms
[2022-05-15 13:58:47] [INFO ] Time to serialize properties into /tmp/LTL18326545872644339406.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5827866527590302055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18326545872644339406.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5827866...246
Read 1 LTL properties
Checking formula 0 : !(((F((F("(i16.u56.p201==1)"))||("(i4.i0.u5.p12==1)")))||(G(X(X("(i13.i1.u41.p127==0)"))))))
Formula 0 simplified : !(F("(i4.i0.u5.p12==1)" | F"(i16.u56.p201==1)") | GXX"(i13.i1.u41.p127==0)")
Reverse transition relation is NOT exact ! Due to transitions t102, t106, t118, t122, i0.i1.u30.t85, i1.u20.t105, i1.u22.t101, i2.u8.t127, i3.u6.t130, i4.i...585
Computing Next relation with stutter on 41 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
84 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.861894,59088,1,0,101474,660,2446,119104,213,2993,269204
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-02-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-02-LTLFireability-09 finished in 54292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((G(G(p0))||p1)))||F(G(p1))))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 192 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 192 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 189 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 189 transition count 154
Applied a total of 22 rules in 9 ms. Remains 189 /200 variables (removed 11) and now considering 154/165 (removed 11) transitions.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:58:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:58:48] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:58:48] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-15 13:58:48] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 13:58:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:58:48] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/200 places, 154/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/200 places, 154/165 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(EQ s132 0), p1:(EQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2025 reset in 132 ms.
Stack based approach found an accepted trace after 33594 steps with 682 reset with depth 55 and stack size 54 in 64 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-10 finished in 593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Graph (trivial) has 101 edges and 200 vertex of which 7 / 200 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 383 edges and 194 vertex of which 189 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 188 transition count 123
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 159 transition count 123
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 60 place count 159 transition count 86
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 2 with 82 rules applied. Total rules applied 142 place count 114 transition count 86
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 108 transition count 80
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 108 transition count 80
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 2 with 96 rules applied. Total rules applied 250 place count 59 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 58 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 252 place count 57 transition count 32
Applied a total of 252 rules in 10 ms. Remains 57 /200 variables (removed 143) and now considering 32/165 (removed 133) transitions.
// Phase 1: matrix 32 rows 57 cols
[2022-05-15 13:58:48] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-15 13:58:48] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 32 rows 57 cols
[2022-05-15 13:58:48] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-15 13:58:48] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 103 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/200 places, 32/165 transitions.
Graph (complete) has 63 edges and 32 vertex of which 30 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 30 transition count 25
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 24 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 22 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 23
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 23 place count 19 transition count 20
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 19 transition count 19
Applied a total of 24 rules in 3 ms. Remains 19 /32 variables (removed 13) and now considering 19/32 (removed 13) transitions.
// Phase 1: matrix 19 rows 19 cols
[2022-05-15 13:58:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 13:58:48] [INFO ] Implicit Places using invariants in 26 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/200 places, 19/165 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 18
Applied a total of 2 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 13:58:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 13:58:48] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 13:58:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 13:58:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 17/200 places, 18/165 transitions.
Finished structural reductions, in 3 iterations. Remains : 17/200 places, 18/165 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-11 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 s16 1)], 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 0 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 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)&&F(p1))))))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 191 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 191 transition count 156
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 188 transition count 153
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 188 transition count 153
Applied a total of 24 rules in 10 ms. Remains 188 /200 variables (removed 12) and now considering 153/165 (removed 12) transitions.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:58:49] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 13:58:49] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:58:49] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:58:49] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:58:49] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-15 13:58:49] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/200 places, 153/165 transitions.
Finished structural reductions, in 1 iterations. Remains : 188/200 places, 153/165 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(EQ s181 0), p1:(EQ s17 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 70 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-12 finished in 531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(F(X(G(p0))))))))'
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 165/165 transitions.
Graph (trivial) has 100 edges and 200 vertex of which 4 / 200 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 387 edges and 197 vertex of which 192 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 191 transition count 126
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 161 transition count 126
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 161 transition count 88
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 115 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 109 transition count 82
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 109 transition count 82
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 2 with 96 rules applied. Total rules applied 254 place count 60 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 60 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 256 place count 59 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 58 transition count 34
Applied a total of 257 rules in 16 ms. Remains 58 /200 variables (removed 142) and now considering 34/165 (removed 131) transitions.
// Phase 1: matrix 34 rows 58 cols
[2022-05-15 13:58:49] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:58:49] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 34 rows 58 cols
[2022-05-15 13:58:49] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:58:49] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 108 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/200 places, 34/165 transitions.
Graph (complete) has 65 edges and 33 vertex of which 31 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 31 transition count 27
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 25 transition count 27
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 23 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 23 transition count 25
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 26 place count 18 transition count 21
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 28 place count 17 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 17 transition count 19
Applied a total of 29 rules in 4 ms. Remains 17 /33 variables (removed 16) and now considering 19/34 (removed 15) transitions.
// Phase 1: matrix 19 rows 17 cols
[2022-05-15 13:58:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 13:58:49] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 19 rows 17 cols
[2022-05-15 13:58:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 13:58:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/200 places, 19/165 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/200 places, 19/165 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 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 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-13 finished in 232 ms.
All properties solved by simple procedures.
Total runtime 65002 ms.

BK_STOP 1652623129917

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-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 r024-tall-165251918400332"
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 ;