Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599200395.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 SemanticWebServices-PT-S128P12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599200395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.5K Apr 29 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 12:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 224K May 10 09:34 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 SemanticWebServices-PT-S128P12-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652966633059

Running Version 202205111006
[2022-05-19 13:23:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-19 13:23:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:23:54] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2022-05-19 13:23:54] [INFO ] Transformed 191 places.
[2022-05-19 13:23:54] [INFO ] Transformed 414 transitions.
[2022-05-19 13:23:54] [INFO ] Parsed PT model containing 191 places and 414 transitions in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 208 transitions
Reduce redundant transitions removed 208 transitions.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 204/204 transitions.
Ensure Unique test removed 31 places
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 84 transition count 97
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 218 place count 78 transition count 91
Iterating global reduction 1 with 6 rules applied. Total rules applied 224 place count 78 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 225 place count 78 transition count 90
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 229 place count 74 transition count 86
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 74 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 236 place count 71 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 239 place count 71 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 70 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 70 transition count 82
Applied a total of 241 rules in 29 ms. Remains 70 /189 variables (removed 119) and now considering 82/204 (removed 122) transitions.
[2022-05-19 13:23:54] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 70 cols
[2022-05-19 13:23:54] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-19 13:23:54] [INFO ] Implicit Places using invariants in 139 ms returned []
[2022-05-19 13:23:54] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 70 cols
[2022-05-19 13:23:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 13:23:54] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-05-19 13:23:54] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2022-05-19 13:23:54] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 70 cols
[2022-05-19 13:23:54] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-19 13:23:54] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/189 places, 82/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/189 places, 82/204 transitions.
Support contains 30 out of 70 places after structural reductions.
[2022-05-19 13:23:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 13:23:54] [INFO ] Flatten gal took : 19 ms
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 13:23:54] [INFO ] Flatten gal took : 6 ms
[2022-05-19 13:23:55] [INFO ] Input system was already deterministic with 82 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 13:23:55] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 70 cols
[2022-05-19 13:23:55] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-19 13:23:55] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||F(p1))&&(X(X(p2))||F(p1))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Graph (complete) has 119 edges and 70 vertex of which 51 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.3 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 49 transition count 63
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 43 transition count 57
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 43 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 43 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 39 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 39 transition count 52
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 36 transition count 49
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 36 transition count 49
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 34 transition count 47
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 34 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 33 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 33 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 33 transition count 45
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 33 transition count 43
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 65 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 31 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 30 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 30 transition count 41
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 28 transition count 39
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 28 transition count 39
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 25 transition count 36
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 25 transition count 36
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 70 place count 21 transition count 32
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 21 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 78 place count 21 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 20 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 82 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 83 place count 19 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 84 place count 18 transition count 24
Iterating global reduction 7 with 1 rules applied. Total rules applied 85 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 86 place count 17 transition count 23
Iterating global reduction 7 with 1 rules applied. Total rules applied 87 place count 17 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 88 place count 17 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 89 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 90 place count 16 transition count 21
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 91 place count 15 transition count 20
Iterating global reduction 9 with 1 rules applied. Total rules applied 92 place count 15 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 93 place count 15 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 94 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 95 place count 14 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 96 place count 14 transition count 17
Applied a total of 96 rules in 48 ms. Remains 14 /70 variables (removed 56) and now considering 17/82 (removed 65) transitions.
// Phase 1: matrix 17 rows 14 cols
[2022-05-19 13:23:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:55] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 17 rows 14 cols
[2022-05-19 13:23:55] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-19 13:23:55] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-19 13:23:55] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 17 rows 14 cols
[2022-05-19 13:23:55] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:55] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/70 places, 17/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/70 places, 17/82 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s12 s4), p1:(LEQ 3 s3), p2:(GT 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-00 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&F(p1)&&F(!p0)))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Graph (complete) has 119 edges and 70 vertex of which 50 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 48 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 43 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 43 transition count 57
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 39 transition count 53
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 39 transition count 53
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 35 transition count 49
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 35 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 32 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 32 transition count 46
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 30 transition count 44
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 30 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 30 transition count 42
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 61 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 28 transition count 39
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 27 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 27 transition count 38
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 25 transition count 36
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 25 transition count 36
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 23 transition count 34
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 23 transition count 34
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 20 transition count 31
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 20 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 78 place count 20 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 20 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 19 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 18 transition count 26
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 17 transition count 25
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 85 place count 16 transition count 24
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 16 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 87 place count 16 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 89 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 90 place count 15 transition count 21
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 91 place count 14 transition count 20
Iterating global reduction 8 with 1 rules applied. Total rules applied 92 place count 14 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 93 place count 14 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 95 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 96 place count 13 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 97 place count 13 transition count 16
Applied a total of 97 rules in 33 ms. Remains 13 /70 variables (removed 57) and now considering 16/82 (removed 66) transitions.
// Phase 1: matrix 16 rows 13 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:56] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 16 rows 13 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:23:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-19 13:23:56] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 16 rows 13 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/70 places, 16/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/70 places, 16/82 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 1 s2), p0:(LEQ s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-02 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(G(p0)))))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Graph (complete) has 119 edges and 70 vertex of which 49 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 47 transition count 61
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 41 transition count 55
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 41 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 41 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 37 transition count 50
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 37 transition count 50
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 33 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 33 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 30 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 30 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 28 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 28 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 28 transition count 39
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 28 transition count 37
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 58 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 26 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 25 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 25 transition count 35
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 23 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 72 place count 20 transition count 30
Iterating global reduction 4 with 3 rules applied. Total rules applied 75 place count 20 transition count 30
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 78 place count 17 transition count 27
Iterating global reduction 4 with 3 rules applied. Total rules applied 81 place count 17 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 84 place count 17 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 17 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 86 place count 16 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 87 place count 16 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 88 place count 15 transition count 22
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 89 place count 14 transition count 21
Iterating global reduction 7 with 1 rules applied. Total rules applied 90 place count 14 transition count 21
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 91 place count 13 transition count 20
Iterating global reduction 7 with 1 rules applied. Total rules applied 92 place count 13 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 93 place count 13 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 94 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 95 place count 12 transition count 18
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 96 place count 11 transition count 17
Iterating global reduction 9 with 1 rules applied. Total rules applied 97 place count 11 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 98 place count 11 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 100 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 101 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 102 place count 10 transition count 13
Applied a total of 102 rules in 21 ms. Remains 10 /70 variables (removed 60) and now considering 13/82 (removed 69) transitions.
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:56] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 13:23:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-19 13:23:56] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:56] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/70 places, 13/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/70 places, 13/82 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s8 s7)], 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 SemanticWebServices-PT-S128P12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-03 finished in 167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(F(p1)||F(!p0)))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 55 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 51 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 51 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 51 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 49 transition count 59
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 49 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 47 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 47 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 46 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 46 transition count 56
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 45 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 45 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 45 transition count 54
Applied a total of 53 rules in 4 ms. Remains 45 /70 variables (removed 25) and now considering 54/82 (removed 28) transitions.
[2022-05-19 13:23:56] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 45 cols
[2022-05-19 13:23:56] [INFO ] Computed 1 place invariants in 17 ms
[2022-05-19 13:23:56] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-19 13:23:56] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 45 cols
[2022-05-19 13:23:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:23:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-19 13:23:56] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-19 13:23:56] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 45 cols
[2022-05-19 13:23:56] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:23:56] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/70 places, 54/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/70 places, 54/82 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 3 s10), p1:(GT 3 s39)], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-04 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Graph (complete) has 119 edges and 70 vertex of which 50 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 48 transition count 62
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 42 transition count 56
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 42 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 42 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 38 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 38 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 34 transition count 47
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 34 transition count 47
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 31 transition count 44
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 31 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 29 transition count 42
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 29 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 29 transition count 40
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 58 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 27 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 26 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 26 transition count 36
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 66 place count 24 transition count 34
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 24 transition count 34
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 71 place count 21 transition count 31
Iterating global reduction 4 with 3 rules applied. Total rules applied 74 place count 21 transition count 31
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 78 place count 17 transition count 27
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 17 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 86 place count 17 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 16 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 89 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 90 place count 15 transition count 21
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 91 place count 14 transition count 20
Iterating global reduction 7 with 1 rules applied. Total rules applied 92 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 93 place count 13 transition count 19
Iterating global reduction 7 with 1 rules applied. Total rules applied 94 place count 13 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 95 place count 13 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 96 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 97 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 98 place count 11 transition count 16
Iterating global reduction 9 with 1 rules applied. Total rules applied 99 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 100 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 101 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 102 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 103 place count 10 transition count 13
Applied a total of 103 rules in 14 ms. Remains 10 /70 variables (removed 60) and now considering 13/82 (removed 69) transitions.
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:56] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 13:23:56] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-19 13:23:56] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 13:23:56] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/70 places, 13/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/70 places, 13/82 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s4)], 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 SemanticWebServices-PT-S128P12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-05 finished in 134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1)&&p2)))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 56 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 51 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 51 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 51 transition count 61
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 48 transition count 58
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 48 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 45 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 45 transition count 55
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 43 transition count 53
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 43 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 41 transition count 51
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 41 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 41 transition count 49
Applied a total of 62 rules in 7 ms. Remains 41 /70 variables (removed 29) and now considering 49/82 (removed 33) transitions.
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 41 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:23:57] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 41 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:23:57] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 13:23:57] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 41 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 13:23:57] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/70 places, 49/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/70 places, 49/82 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s7 0), p0:(LEQ s18 s29), p1:(LEQ 1 s34)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-06 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (!F(!p0)&&p1))||X(p2)))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 55 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 51 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 51 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 51 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 49 transition count 59
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 49 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 47 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 47 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 46 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 46 transition count 56
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 45 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 45 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 45 transition count 54
Applied a total of 53 rules in 11 ms. Remains 45 /70 variables (removed 25) and now considering 54/82 (removed 28) transitions.
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 45 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:23:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 45 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:23:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-19 13:23:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 45 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:23:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/70 places, 54/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/70 places, 54/82 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p2:(LEQ 1 s34), p0:(GT 2 s39), p1:(LEQ 3 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-07 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0 U p1)))||p0)))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 55 transition count 66
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 52 transition count 63
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 52 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 52 transition count 62
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 51 transition count 61
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 51 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 50 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 50 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 49 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 49 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 48 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 48 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 48 transition count 57
Applied a total of 47 rules in 3 ms. Remains 48 /70 variables (removed 22) and now considering 57/82 (removed 25) transitions.
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 48 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:23:57] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 48 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:23:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-05-19 13:23:57] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2022-05-19 13:23:57] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 48 cols
[2022-05-19 13:23:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:23:57] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/70 places, 57/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/70 places, 57/82 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LEQ s41 s29), p1:(LEQ s27 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-10 finished in 778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U p2)))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Graph (complete) has 119 edges and 70 vertex of which 53 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 46 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 46 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 46 transition count 59
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 42 transition count 55
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 42 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 38 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 38 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 35 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 35 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 33 transition count 46
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 33 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 33 transition count 44
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 33 transition count 42
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 60 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 31 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 30 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 30 transition count 40
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 61 place count 28 transition count 38
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 28 transition count 38
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 66 place count 25 transition count 35
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 25 transition count 35
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 72 place count 22 transition count 32
Iterating global reduction 4 with 3 rules applied. Total rules applied 75 place count 22 transition count 32
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 78 place count 22 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 22 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 21 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 82 place count 20 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 83 place count 19 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 84 place count 19 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 85 place count 18 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 86 place count 18 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 87 place count 18 transition count 24
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 89 place count 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 90 place count 17 transition count 22
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 91 place count 16 transition count 21
Iterating global reduction 9 with 1 rules applied. Total rules applied 92 place count 16 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 93 place count 16 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 94 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 95 place count 15 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 96 place count 15 transition count 18
Applied a total of 96 rules in 25 ms. Remains 15 /70 variables (removed 55) and now considering 18/82 (removed 64) transitions.
// Phase 1: matrix 18 rows 15 cols
[2022-05-19 13:23:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:58] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-05-19 13:23:58] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:23:58] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-19 13:23:58] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-05-19 13:23:58] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/70 places, 18/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/70 places, 18/82 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ s9 s5), p0:(LEQ s4 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 159 ms.
Product exploration explored 100000 steps with 0 reset in 250 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 3568 steps, including 1 resets, run visited all 1 properties in 14 ms. (steps per millisecond=254 )
Knowledge obtained : [(AND p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 15 cols
[2022-05-19 13:23:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:59] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-05-19 13:23:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:23:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:23:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-19 13:23:59] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 18 rows 15 cols
[2022-05-19 13:23:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:23:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 18/18 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 3433 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=343 )
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Built C files in :
/tmp/ltsmin2609486990117946214
[2022-05-19 13:24:00] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-19 13:24:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:00] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-19 13:24:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:00] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-19 13:24:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2609486990117946214
Running compilation step : cd /tmp/ltsmin2609486990117946214;'/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 234 ms.
Running link step : cd /tmp/ltsmin2609486990117946214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2609486990117946214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6752874856467378988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 18/18 transitions.
Graph (complete) has 18 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 15
Applied a total of 4 rules in 2 ms. Remains 12 /15 variables (removed 3) and now considering 15/18 (removed 3) transitions.
// Phase 1: matrix 15 rows 12 cols
[2022-05-19 13:24:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:24:15] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 15 rows 12 cols
[2022-05-19 13:24:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:24:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:24:15] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-19 13:24:15] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 15 rows 12 cols
[2022-05-19 13:24:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:24:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/15 places, 15/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/15 places, 15/18 transitions.
Built C files in :
/tmp/ltsmin14978919511336929420
[2022-05-19 13:24:15] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2022-05-19 13:24:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:15] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2022-05-19 13:24:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:15] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2022-05-19 13:24:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 13:24:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14978919511336929420
Running compilation step : cd /tmp/ltsmin14978919511336929420;'/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 88 ms.
Running link step : cd /tmp/ltsmin14978919511336929420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin14978919511336929420;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16366639937012747820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:24:30] [INFO ] Flatten gal took : 2 ms
[2022-05-19 13:24:30] [INFO ] Flatten gal took : 1 ms
[2022-05-19 13:24:30] [INFO ] Time to serialize gal into /tmp/LTL7341065340124434240.gal : 1 ms
[2022-05-19 13:24:30] [INFO ] Time to serialize properties into /tmp/LTL8424204775788821075.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/LTL7341065340124434240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8424204775788821075.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/LTL7341065...266
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p98<=p157)")||(("((p102<=p150)&&(p65<=p114))")U("(p156<=p102)"))))))
Formula 0 simplified : !GF("(p98<=p157)" | ("((p102<=p150)&&(p65<=p114))" U "(p156<=p102)"))
Detected timeout of ITS tools.
[2022-05-19 13:24:45] [INFO ] Flatten gal took : 1 ms
[2022-05-19 13:24:45] [INFO ] Applying decomposition
[2022-05-19 13:24:45] [INFO ] Flatten gal took : 1 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/graph6284223610697794687.txt' '-o' '/tmp/graph6284223610697794687.bin' '-w' '/tmp/graph6284223610697794687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6284223610697794687.bin' '-l' '-1' '-v' '-w' '/tmp/graph6284223610697794687.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:24:45] [INFO ] Decomposing Gal with order
[2022-05-19 13:24:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:24:45] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-19 13:24:45] [INFO ] Flatten gal took : 37 ms
[2022-05-19 13:24:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2022-05-19 13:24:45] [INFO ] Time to serialize gal into /tmp/LTL6339318060474684757.gal : 1 ms
[2022-05-19 13:24:45] [INFO ] Time to serialize properties into /tmp/LTL9967116337155897299.ltl : 2 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/LTL6339318060474684757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9967116337155897299.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/LTL6339318...266
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu4.p98<=gu4.p157)")||(("((gu3.p102<=gu3.p150)&&(gu1.p65<=gu1.p114))")U("(gu3.p156<=gu3.p102)"))))))
Formula 0 simplified : !GF("(gu4.p98<=gu4.p157)" | ("((gu3.p102<=gu3.p150)&&(gu1.p65<=gu1.p114))" U "(gu3.p156<=gu3.p102)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2943109222902075907
[2022-05-19 13:25:00] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2943109222902075907
Running compilation step : cd /tmp/ltsmin2943109222902075907;'/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 53 ms.
Running link step : cd /tmp/ltsmin2943109222902075907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 18 ms.
Running LTSmin : cd /tmp/ltsmin2943109222902075907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 406 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-11 finished in 62827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 56 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 51 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 51 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 51 transition count 61
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 48 transition count 58
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 48 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 45 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 45 transition count 55
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 43 transition count 53
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 43 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 41 transition count 51
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 41 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 41 transition count 49
Applied a total of 62 rules in 6 ms. Remains 41 /70 variables (removed 29) and now considering 49/82 (removed 33) transitions.
[2022-05-19 13:25:01] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 41 cols
[2022-05-19 13:25:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:25:01] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 13:25:01] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 41 cols
[2022-05-19 13:25:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:25:01] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 13:25:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-19 13:25:01] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 41 cols
[2022-05-19 13:25:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:25:01] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/70 places, 49/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/70 places, 49/82 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s10 s19)], 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][false, false]]
Stuttering criterion allowed to conclude after 5 steps with 2 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-13 finished in 209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 82/82 transitions.
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 55 transition count 66
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 50 transition count 61
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 50 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 50 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 47 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 47 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 44 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 44 transition count 54
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 42 transition count 52
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 42 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 40 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 40 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 40 transition count 48
Applied a total of 64 rules in 3 ms. Remains 40 /70 variables (removed 30) and now considering 48/82 (removed 34) transitions.
[2022-05-19 13:25:01] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 40 cols
[2022-05-19 13:25:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 13:25:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-19 13:25:01] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 40 cols
[2022-05-19 13:25:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:25:01] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 13:25:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-19 13:25:01] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 40 cols
[2022-05-19 13:25:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:25:01] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/70 places, 48/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/70 places, 48/82 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s31 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 413 steps with 137 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLCardinality-15 finished in 260 ms.
All properties solved by simple procedures.
Total runtime 67634 ms.

BK_STOP 1652966701837

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="SemanticWebServices-PT-S128P12"
export BK_EXAMINATION="LTLCardinality"
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 SemanticWebServices-PT-S128P12, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r204-oct2-165281599200395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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