About the Execution of ITS-Tools for SemanticWebServices-PT-S064P06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
235.787 | 5075.00 | 9605.00 | 60.40 | FTTFFFTFFFTFFFFF | normal |
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-165281599100339.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-S064P06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599100339
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 12:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:43 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 96K 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-S064P06-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652960057512
Running Version 202205111006
[2022-05-19 11:34:18] [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 11:34:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:34:18] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-05-19 11:34:18] [INFO ] Transformed 97 places.
[2022-05-19 11:34:18] [INFO ] Transformed 164 transitions.
[2022-05-19 11:34:18] [INFO ] Parsed PT model containing 97 places and 164 transitions in 162 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 1 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 82/82 transitions.
Ensure Unique test removed 13 places
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 54 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 49 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 49 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 69 place count 49 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 48 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 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 72 place count 48 transition count 57
Applied a total of 72 rules in 32 ms. Remains 48 /95 variables (removed 47) and now considering 57/82 (removed 25) transitions.
[2022-05-19 11:34:18] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 11:34:18] [INFO ] Computed 2 place invariants in 10 ms
[2022-05-19 11:34:19] [INFO ] Implicit Places using invariants in 162 ms returned []
[2022-05-19 11:34:19] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 11:34:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 11:34:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-19 11:34:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2022-05-19 11:34:19] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
// Phase 1: matrix 49 rows 48 cols
[2022-05-19 11:34:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 11:34:19] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/95 places, 57/82 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/95 places, 57/82 transitions.
Support contains 31 out of 48 places after structural reductions.
[2022-05-19 11:34:19] [INFO ] Flatten gal took : 15 ms
[2022-05-19 11:34:19] [INFO ] Flatten gal took : 5 ms
[2022-05-19 11:34:19] [INFO ] Input system was already deterministic with 57 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 18) seen :17
Finished Best-First random walk after 4004 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=800 )
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(X(p0)) U G(((X(p1)&&p2)||p0)))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 32 transition count 42
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 27 transition count 37
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 27 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 27 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 23 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 23 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 23 transition count 27
Applied a total of 55 rules in 3 ms. Remains 23 /48 variables (removed 25) and now considering 27/57 (removed 30) transitions.
[2022-05-19 11:34:19] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 11:34:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 11:34:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 11:34:19] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 11:34:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 11:34:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-19 11:34:19] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-19 11:34:19] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 11:34:19] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 11:34:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/48 places, 27/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/48 places, 27/57 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR p0 (AND p1 p2)), (OR p0 (AND p1 p2)), p0, (OR (AND p1 p2) (AND p0 p1)), p0, (AND p0 p1), p0]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 1}], [{ cond=p0, acceptance={} source=6 dest: 1}]], initial=0, aps=[p0:(LEQ s21 s17), p2:(LEQ s20 s10), p1:(LEQ s9 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 2 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-00 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))||F(p1))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Graph (complete) has 63 edges and 48 vertex of which 25 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 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 24 transition count 37
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 18 transition count 31
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 18 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 18 transition count 29
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 14 transition count 25
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 14 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 14 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 20 edges and 13 vertex of which 12 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 3 with 2 rules applied. Total rules applied 48 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 11 transition count 16
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 51 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 53 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 10 transition count 13
Applied a total of 54 rules in 28 ms. Remains 10 /48 variables (removed 38) and now considering 13/57 (removed 44) transitions.
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 11:34:20] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 11:34:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 11:34:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-19 11:34:20] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 13 rows 10 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 11:34:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/48 places, 13/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/48 places, 13/57 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 s1), p1:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-03 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(G(F(X(p0))))))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Graph (complete) has 63 edges and 48 vertex of which 25 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 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 24 transition count 37
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 17 transition count 30
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 17 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 17 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 39 place count 11 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 11 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 11 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 15 edges and 10 vertex of which 9 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 3 with 2 rules applied. Total rules applied 55 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 8 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 8 transition count 11
Applied a total of 58 rules in 14 ms. Remains 8 /48 variables (removed 40) and now considering 11/57 (removed 46) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 11:34:20] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 11:34:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:34:20] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-19 11:34:20] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 11:34:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/48 places, 11/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/48 places, 11/57 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s4 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-04 finished in 161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Graph (complete) has 63 edges and 48 vertex of which 25 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 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 24 transition count 37
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 17 transition count 30
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 17 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 17 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 39 place count 11 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 11 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 11 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 15 edges and 10 vertex of which 9 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 55 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 8 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 8 transition count 11
Applied a total of 58 rules in 16 ms. Remains 8 /48 variables (removed 40) and now considering 11/57 (removed 46) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 11:34:20] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 11:34:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:34:20] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-19 11:34:20] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:20] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-19 11:34:21] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/48 places, 11/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/48 places, 11/57 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-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:(GT s5 s1)], 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-S064P06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-05 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Graph (complete) has 63 edges and 48 vertex of which 25 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 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 24 transition count 37
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 17 transition count 30
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 17 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 17 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 39 place count 11 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 11 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 11 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 15 edges and 10 vertex of which 9 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 55 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 8 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 8 transition count 11
Applied a total of 58 rules in 8 ms. Remains 8 /48 variables (removed 40) and now considering 11/57 (removed 46) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:34:21] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-05-19 11:34:21] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:21] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/48 places, 11/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/48 places, 11/57 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-07 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 s3 s5)], 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 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-07 finished in 292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X((p1 U p2)))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 32 transition count 42
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 27 transition count 37
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 27 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 27 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 24 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 24 transition count 32
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 24 transition count 29
Applied a total of 52 rules in 3 ms. Remains 24 /48 variables (removed 24) and now considering 29/57 (removed 28) transitions.
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 24 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 11:34:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 24 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 11:34:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
// Phase 1: matrix 26 rows 24 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/48 places, 29/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/48 places, 29/57 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s12 s10), p2:(LEQ 1 s21), p1:(LEQ s9 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-S064P06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-11 finished in 247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F((X(F(G(p1)))||p0))))&&F(!p1)))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Graph (complete) has 63 edges and 48 vertex of which 32 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Reduce places removed 1 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 31 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 16 place count 31 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 29 transition count 39
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 23 transition count 33
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 23 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 23 transition count 31
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 19 transition count 27
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 19 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 19 transition count 23
Applied a total of 46 rules in 16 ms. Remains 19 /48 variables (removed 29) and now considering 23/57 (removed 34) transitions.
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-19 11:34:21] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 11:34:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-19 11:34:21] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 11:34:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/48 places, 23/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/48 places, 23/57 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p1), p1, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s6 s1), p0:(OR (GT s7 s13) (GT s5 s13))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-12 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(X(X(X(p0)))))))&&X((p1 U !p0)))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 30 transition count 40
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 26 transition count 36
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 26 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 26 transition count 34
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 23 transition count 31
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 23 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 23 transition count 28
Applied a total of 54 rules in 6 ms. Remains 23 /48 variables (removed 25) and now considering 28/57 (removed 29) transitions.
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 11:34:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-19 11:34:21] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-19 11:34:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 11:34:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/48 places, 28/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/48 places, 28/57 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, true, true, true, p0, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 3}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ s5 s14), p1:(LEQ s20 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-13 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 24 transition count 34
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 24 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 24 transition count 32
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 19 transition count 27
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 19 transition count 27
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 19 transition count 22
Applied a total of 64 rules in 2 ms. Remains 19 /48 variables (removed 29) and now considering 22/57 (removed 35) transitions.
[2022-05-19 11:34:22] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 11:34:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 11:34:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-19 11:34:22] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 11:34:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 11:34:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 11:34:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-19 11:34:22] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-19 11:34:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 11:34:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/48 places, 22/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/48 places, 22/57 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-14 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 3 s14)], 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 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-14 finished in 146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 57/57 transitions.
Graph (complete) has 63 edges and 48 vertex of which 24 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 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 23 transition count 36
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 17 transition count 30
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 17 transition count 30
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 17 transition count 29
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 37 place count 11 transition count 23
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 11 transition count 23
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 49 place count 11 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 17 edges and 10 vertex of which 9 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 3 with 2 rules applied. Total rules applied 53 place count 9 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 8 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 57 place count 8 transition count 11
Applied a total of 57 rules in 7 ms. Remains 8 /48 variables (removed 40) and now considering 11/57 (removed 46) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 11:34:22] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 11:34:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:34:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-19 11:34:22] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-19 11:34:22] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 11:34:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/48 places, 11/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/48 places, 11/57 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s5 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P06-LTLCardinality-15 finished in 107 ms.
All properties solved by simple procedures.
Total runtime 4003 ms.
BK_STOP 1652960062587
--------------------
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-S064P06"
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-S064P06, 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-165281599100339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S064P06.tgz
mv SemanticWebServices-PT-S064P06 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 '
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 ;