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-165281599200364.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-S064P15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599200364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.4K Apr 29 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 12:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K 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 137K 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-S064P15-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S064P15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652963117300

Running Version 202205111006
[2022-05-19 12:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 12:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:25:18] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-19 12:25:18] [INFO ] Transformed 118 places.
[2022-05-19 12:25:18] [INFO ] Transformed 194 transitions.
[2022-05-19 12:25:18] [INFO ] Parsed PT model containing 118 places and 194 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 101 transitions
Reduce redundant transitions removed 101 transitions.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 91/91 transitions.
Ensure Unique test removed 22 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 92 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 87 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 87 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 87 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 85 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 85 transition count 83
Applied a total of 39 rules in 14 ms. Remains 85 /116 variables (removed 31) and now considering 83/91 (removed 8) transitions.
[2022-05-19 12:25:18] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 85 cols
[2022-05-19 12:25:18] [INFO ] Computed 13 place invariants in 12 ms
[2022-05-19 12:25:18] [INFO ] Implicit Places using invariants in 133 ms returned []
[2022-05-19 12:25:18] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 85 cols
[2022-05-19 12:25:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-19 12:25:18] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-19 12:25:18] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2022-05-19 12:25:18] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 85 cols
[2022-05-19 12:25:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-19 12:25:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/116 places, 83/91 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/116 places, 83/91 transitions.
Support contains 37 out of 85 places after structural reductions.
[2022-05-19 12:25:19] [INFO ] Flatten gal took : 20 ms
[2022-05-19 12:25:19] [INFO ] Flatten gal took : 6 ms
[2022-05-19 12:25:19] [INFO ] Input system was already deterministic with 83 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Finished Best-First random walk after 89 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=89 )
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 215 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(X(p0)) U X((F((F(p1)||p2))&&!p3)))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 71 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 71 transition count 78
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 67 transition count 74
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 67 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 64 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 64 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 61 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 61 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 59 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 59 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 58 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 58 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 58 transition count 64
Applied a total of 46 rules in 9 ms. Remains 58 /85 variables (removed 27) and now considering 64/83 (removed 19) transitions.
[2022-05-19 12:25:19] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 58 cols
[2022-05-19 12:25:19] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-19 12:25:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-19 12:25:19] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 58 cols
[2022-05-19 12:25:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 12:25:19] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-05-19 12:25:19] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2022-05-19 12:25:19] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 58 cols
[2022-05-19 12:25:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 12:25:19] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/85 places, 64/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/85 places, 64/83 transitions.
Stuttering acceptance computed with spot in 425 ms :[true, (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), (OR (AND p0 p1) (AND p0 p2)), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), p0, (OR p2 p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p2)), acceptance={} source=1 dest: 0}, { cond=(AND p3 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND p3 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p3) p0 p1) (AND (NOT p3) p0 p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=p0, acceptance={0} source=6 dest: 6}], [{ cond=(OR p1 p2), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=4, aps=[p3:(AND (GEQ s7 1) (GEQ s39 1)), p1:(GEQ s9 1), p2:(AND (GEQ s8 1) (GEQ s51 1)), p0:(AND (GEQ s6 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 4 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-00 finished in 621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&F(G(((p1 U p2)||p1)))))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 73 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 68 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 68 transition count 78
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 63 transition count 73
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 63 transition count 73
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 59 transition count 69
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 59 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 55 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 55 transition count 65
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 52 transition count 62
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 52 transition count 62
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 49 transition count 59
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 49 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 49 transition count 56
Applied a total of 63 rules in 11 ms. Remains 49 /85 variables (removed 36) and now considering 56/83 (removed 27) transitions.
[2022-05-19 12:25:20] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:25:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-19 12:25:20] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:25:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:25:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-19 12:25:20] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-19 12:25:20] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:25:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:25:20] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/85 places, 56/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/85 places, 56/83 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s24 1) (GEQ s30 1)), p1:(GEQ s10 1), p2:(GEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-01 finished in 337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||F(X(p1))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 75 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 71 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 71 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 67 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 67 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 63 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 63 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 60 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 60 transition count 68
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 57 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 57 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 55 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 55 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 55 transition count 61
Applied a total of 52 rules in 16 ms. Remains 55 /85 variables (removed 30) and now considering 61/83 (removed 22) transitions.
[2022-05-19 12:25:20] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 55 cols
[2022-05-19 12:25:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 12:25:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 12:25:20] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 55 cols
[2022-05-19 12:25:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:25:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-19 12:25:20] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-19 12:25:20] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 55 cols
[2022-05-19 12:25:20] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-19 12:25:20] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/85 places, 61/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/85 places, 61/83 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s35 1)), p1:(AND (GEQ s6 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-02 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(p0 U p1))||(p0 U F(p2))||p0)))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Graph (complete) has 215 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 63 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 63 transition count 75
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 58 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 58 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 23 place count 54 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 54 transition count 66
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 31 place count 50 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 50 transition count 62
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 38 place count 47 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 41 place count 47 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 42 place count 46 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 46 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 44 place count 46 transition count 57
Applied a total of 44 rules in 28 ms. Remains 46 /85 variables (removed 39) and now considering 57/83 (removed 26) transitions.
[2022-05-19 12:25:21] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-19 12:25:21] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:21] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-19 12:25:21] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:25:21] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-19 12:25:21] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:25:21] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:25:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/85 places, 57/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/85 places, 57/83 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s45 1)), p2:(GEQ s12 1), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 0 reset in 270 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Finished Best-First random walk after 4701 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1175 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 57/57 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2022-05-19 12:25:22] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-19 12:25:22] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:22] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:25:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-19 12:25:22] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:25:22] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:25:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 57/57 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Finished Best-First random walk after 2013 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1006 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Built C files in :
/tmp/ltsmin13405211797400910515
[2022-05-19 12:25:23] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2022-05-19 12:25:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:25:23] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2022-05-19 12:25:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:25:23] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2022-05-19 12:25:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:25:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13405211797400910515
Running compilation step : cd /tmp/ltsmin13405211797400910515;'/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 205 ms.
Running link step : cd /tmp/ltsmin13405211797400910515;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13405211797400910515;'/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/stateBased3035250980948118432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 57/57 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2022-05-19 12:25:38] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-19 12:25:38] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:25:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-19 12:25:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-19 12:25:38] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:25:38] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 46 cols
[2022-05-19 12:25:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:25:38] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 57/57 transitions.
Built C files in :
/tmp/ltsmin12664463282580451202
[2022-05-19 12:25:38] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2022-05-19 12:25:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:25:38] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2022-05-19 12:25:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:25:38] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2022-05-19 12:25:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:25:38] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12664463282580451202
Running compilation step : cd /tmp/ltsmin12664463282580451202;'/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 109 ms.
Running link step : cd /tmp/ltsmin12664463282580451202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12664463282580451202;'/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/stateBased9500892294711582764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 12:25:54] [INFO ] Flatten gal took : 5 ms
[2022-05-19 12:25:54] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:25:54] [INFO ] Time to serialize gal into /tmp/LTL11819707696987780766.gal : 1 ms
[2022-05-19 12:25:54] [INFO ] Time to serialize properties into /tmp/LTL135629290318435656.ltl : 1 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/LTL11819707696987780766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL135629290318435656.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/LTL1181970...266
Read 1 LTL properties
Checking formula 0 : !((G(((F(!(("((p35>=1)&&(p114>=1))")U("(p58>=1)"))))||(("((p35>=1)&&(p114>=1))")U(F("(p55>=1)"))))||("((p35>=1)&&(p114>=1))"))))
Formula 0 simplified : !G("((p35>=1)&&(p114>=1))" | F!("((p35>=1)&&(p114>=1))" U "(p58>=1)") | ("((p35>=1)&&(p114>=1))" U F"(p55>=1)"))
Detected timeout of ITS tools.
[2022-05-19 12:26:09] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:26:09] [INFO ] Applying decomposition
[2022-05-19 12:26:09] [INFO ] Flatten gal took : 2 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/graph2265320714517243407.txt' '-o' '/tmp/graph2265320714517243407.bin' '-w' '/tmp/graph2265320714517243407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2265320714517243407.bin' '-l' '-1' '-v' '-w' '/tmp/graph2265320714517243407.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:26:09] [INFO ] Decomposing Gal with order
[2022-05-19 12:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:26:09] [INFO ] Removed a total of 11 redundant transitions.
[2022-05-19 12:26:09] [INFO ] Flatten gal took : 31 ms
[2022-05-19 12:26:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2022-05-19 12:26:09] [INFO ] Time to serialize gal into /tmp/LTL8957499428490090136.gal : 1 ms
[2022-05-19 12:26:09] [INFO ] Time to serialize properties into /tmp/LTL2588717360954774220.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/LTL8957499428490090136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2588717360954774220.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8957499...245
Read 1 LTL properties
Checking formula 0 : !((G(((F(!(("((i1.u6.p35>=1)&&(i1.u6.p114>=1))")U("(i3.u3.p58>=1)"))))||(("((i1.u6.p35>=1)&&(i1.u6.p114>=1))")U(F("(i4.u5.p55>=1)"))))...197
Formula 0 simplified : !G("((i1.u6.p35>=1)&&(i1.u6.p114>=1))" | F!("((i1.u6.p35>=1)&&(i1.u6.p114>=1))" U "(i3.u3.p58>=1)") | ("((i1.u6.p35>=1)&&(i1.u6.p114...183
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8172649007427273183
[2022-05-19 12:26:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8172649007427273183
Running compilation step : cd /tmp/ltsmin8172649007427273183;'/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 98 ms.
Running link step : cd /tmp/ltsmin8172649007427273183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 19 ms.
Running LTSmin : cd /tmp/ltsmin8172649007427273183;'/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) U (LTLAPp1==true)))||((LTLAPp0==true) U <>((LTLAPp2==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-03 finished in 78360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0) U (F(p0)||p1))))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 75 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 71 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 71 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 67 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 67 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 62 transition count 70
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 62 transition count 70
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 58 transition count 66
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 58 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 54 transition count 62
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 54 transition count 62
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 52 transition count 60
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 52 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 52 transition count 58
Applied a total of 58 rules in 7 ms. Remains 52 /85 variables (removed 33) and now considering 58/83 (removed 25) transitions.
[2022-05-19 12:26:39] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 52 cols
[2022-05-19 12:26:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:26:39] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-19 12:26:39] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 52 cols
[2022-05-19 12:26:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:26:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-19 12:26:39] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-19 12:26:39] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 52 cols
[2022-05-19 12:26:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:26:39] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/85 places, 58/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/85 places, 58/83 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s6 1) (GEQ s45 1)), p1:(AND (GEQ s7 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5 reset in 66 ms.
Product exploration explored 100000 steps with 0 reset in 239 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 114 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-19 12:26:40] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 52 cols
[2022-05-19 12:26:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:26:40] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 12:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:40] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 12:26:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:26:40] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:40] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-19 12:26:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-19 12:26:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-05 finished in 1722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Graph (complete) has 215 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 61 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 61 transition count 73
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 54 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 54 transition count 66
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 33 place count 48 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 48 transition count 60
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 45 place count 42 transition count 54
Iterating global reduction 0 with 6 rules applied. Total rules applied 51 place count 42 transition count 54
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 55 place count 38 transition count 50
Iterating global reduction 0 with 4 rules applied. Total rules applied 59 place count 38 transition count 50
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 62 place count 35 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 35 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 68 place count 35 transition count 44
Applied a total of 68 rules in 5 ms. Remains 35 /85 variables (removed 50) and now considering 44/83 (removed 39) transitions.
[2022-05-19 12:26:41] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 35 cols
[2022-05-19 12:26:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:41] [INFO ] Implicit Places using invariants in 209 ms returned []
[2022-05-19 12:26:41] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 35 cols
[2022-05-19 12:26:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:41] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-19 12:26:41] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2022-05-19 12:26:41] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:26:41] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 35 cols
[2022-05-19 12:26:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:41] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/85 places, 44/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/85 places, 44/83 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s15 1), p1:(AND (GEQ s1 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 71 ms.
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-06 finished in 525 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 75 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 71 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 71 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 67 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 67 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 63 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 63 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 60 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 60 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 58 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 58 transition count 66
Applied a total of 44 rules in 22 ms. Remains 58 /85 variables (removed 27) and now considering 66/83 (removed 17) transitions.
[2022-05-19 12:26:41] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 58 cols
[2022-05-19 12:26:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 12:26:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-19 12:26:41] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 58 cols
[2022-05-19 12:26:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 12:26:41] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-19 12:26:41] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-19 12:26:41] [INFO ] Flow matrix only has 57 transitions (discarded 9 similar events)
// Phase 1: matrix 57 rows 58 cols
[2022-05-19 12:26:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 12:26:41] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/85 places, 66/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/85 places, 66/83 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s23 1) (AND (GEQ s6 1) (GEQ s50 1))), p0:(AND (OR (LT s7 1) (LT s44 1)) (OR (LT s6 1) (LT s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 128 edges and 58 vertex of which 52 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-07 finished in 861 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(G((p0 U p1)))&&X(p0)&&p0))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 73 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 68 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 68 transition count 78
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 63 transition count 73
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 63 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 58 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 58 transition count 68
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 53 transition count 63
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 53 transition count 63
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 51 transition count 61
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 51 transition count 61
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 49 transition count 59
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 49 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 49 transition count 57
Applied a total of 62 rules in 3 ms. Remains 49 /85 variables (removed 36) and now considering 57/83 (removed 26) transitions.
[2022-05-19 12:26:42] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-19 12:26:42] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-19 12:26:42] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-05-19 12:26:42] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:42] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-19 12:26:42] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/85 places, 57/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/85 places, 57/83 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s31 1), p1:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 0 reset in 267 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 102 edges and 49 vertex of which 43 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 5 states, 13 edges and 2 AP to 5 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 6688 steps, including 2 resets, run visited all 4 properties in 48 ms. (steps per millisecond=139 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (OR p0 p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 5 states, 13 edges and 2 AP to 5 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
[2022-05-19 12:26:44] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:26:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 12:26:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:26:44] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-19 12:26:44] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-19 12:26:44] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2022-05-19 12:26:44] [INFO ] Computed and/alt/rep : 53/65/46 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-19 12:26:44] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
[2022-05-19 12:26:44] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:26:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-19 12:26:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:26:45] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 12:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:45] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-19 12:26:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-19 12:26:45] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2022-05-19 12:26:45] [INFO ] Computed and/alt/rep : 53/65/46 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 12:26:45] [INFO ] Added : 2 causal constraints over 1 iterations in 45 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 57/57 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2022-05-19 12:26:45] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:26:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-19 12:26:45] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:26:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-19 12:26:45] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2022-05-19 12:26:45] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:45] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 57/57 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 102 edges and 49 vertex of which 43 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 5 states, 13 edges and 2 AP to 5 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :2
Finished Best-First random walk after 3390 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=847 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (OR p0 p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 5 states, 13 edges and 2 AP to 5 states, 13 edges and 2 AP.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
[2022-05-19 12:26:46] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:46] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 12:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 12:26:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:26:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:46] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 12:26:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-19 12:26:46] [INFO ] [Nat]Added 41 Read/Feed constraints in 2 ms returned sat
[2022-05-19 12:26:46] [INFO ] Computed and/alt/rep : 53/65/46 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 12:26:46] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
[2022-05-19 12:26:46] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 49 cols
[2022-05-19 12:26:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:46] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-19 12:26:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:26:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:46] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 12:26:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-19 12:26:46] [INFO ] [Nat]Added 41 Read/Feed constraints in 2 ms returned sat
[2022-05-19 12:26:46] [INFO ] Computed and/alt/rep : 53/65/46 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-19 12:26:46] [INFO ] Added : 2 causal constraints over 1 iterations in 45 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-08 finished in 4596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 74 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 69 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 69 transition count 78
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 64 transition count 73
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 64 transition count 73
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 60 transition count 69
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 60 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 56 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 56 transition count 65
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 53 transition count 62
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 53 transition count 62
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 51 transition count 60
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 51 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 51 transition count 58
Applied a total of 59 rules in 5 ms. Remains 51 /85 variables (removed 34) and now considering 58/83 (removed 25) transitions.
[2022-05-19 12:26:47] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 51 cols
[2022-05-19 12:26:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:26:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-19 12:26:47] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 51 cols
[2022-05-19 12:26:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:26:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-19 12:26:47] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-19 12:26:47] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 51 cols
[2022-05-19 12:26:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:26:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/85 places, 58/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/85 places, 58/83 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-09 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:(AND (GEQ s6 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 254 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 109 edges and 51 vertex of which 45 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3445 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=574 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 51 cols
[2022-05-19 12:26:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:26:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 12:26:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 12:26:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 12:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 12:26:48] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-19 12:26:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-19 12:26:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 3 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-09 finished in 1293 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(!(!p0 U p0)) U p1))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Graph (complete) has 215 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 61 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 61 transition count 73
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 54 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 54 transition count 66
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 47 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 47 transition count 59
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 46 place count 42 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 51 place count 42 transition count 54
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 55 place count 38 transition count 50
Iterating global reduction 0 with 4 rules applied. Total rules applied 59 place count 38 transition count 50
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 62 place count 35 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 35 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 68 place count 35 transition count 44
Applied a total of 68 rules in 23 ms. Remains 35 /85 variables (removed 50) and now considering 44/83 (removed 39) transitions.
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 35 cols
[2022-05-19 12:26:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 35 cols
[2022-05-19 12:26:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:26:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-05-19 12:26:48] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-19 12:26:48] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 35 cols
[2022-05-19 12:26:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/85 places, 44/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/85 places, 44/83 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s13 1), p0:(AND (GEQ s1 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-11 finished in 210 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 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Graph (complete) has 215 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 61 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 61 transition count 73
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 54 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 54 transition count 66
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 47 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 47 transition count 59
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 48 place count 40 transition count 52
Iterating global reduction 0 with 7 rules applied. Total rules applied 55 place count 40 transition count 52
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 61 place count 34 transition count 46
Iterating global reduction 0 with 6 rules applied. Total rules applied 67 place count 34 transition count 46
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 72 place count 29 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 77 place count 29 transition count 41
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 82 place count 29 transition count 36
Applied a total of 82 rules in 5 ms. Remains 29 /85 variables (removed 56) and now considering 36/83 (removed 47) transitions.
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 29 cols
[2022-05-19 12:26:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:48] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 29 cols
[2022-05-19 12:26:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-19 12:26:48] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-19 12:26:48] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 29 cols
[2022-05-19 12:26:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/85 places, 36/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/85 places, 36/83 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-12 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&F(p1)))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 74 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 70 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 70 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 66 transition count 75
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 66 transition count 75
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 62 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 62 transition count 71
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 59 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 59 transition count 68
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 56 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 56 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 54 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 54 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 54 transition count 61
Applied a total of 53 rules in 9 ms. Remains 54 /85 variables (removed 31) and now considering 61/83 (removed 22) transitions.
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 54 cols
[2022-05-19 12:26:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:26:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-05-19 12:26:48] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 54 cols
[2022-05-19 12:26:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 12:26:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-19 12:26:49] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2022-05-19 12:26:49] [INFO ] Flow matrix only has 54 transitions (discarded 7 similar events)
// Phase 1: matrix 54 rows 54 cols
[2022-05-19 12:26:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 12:26:49] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/85 places, 61/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/85 places, 61/83 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s31 1), p0:(OR (LT s6 1) (LT s46 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 7 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-13 finished in 414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||F((F(p3)&&p2))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Graph (complete) has 215 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 11 places
Reduce places removed 12 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 63 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 63 transition count 75
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 58 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 58 transition count 70
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 25 place count 52 transition count 64
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 52 transition count 64
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 36 place count 47 transition count 59
Iterating global reduction 0 with 5 rules applied. Total rules applied 41 place count 47 transition count 59
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 46 place count 42 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 51 place count 42 transition count 54
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 54 place count 39 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 57 place count 39 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 60 place count 39 transition count 48
Applied a total of 60 rules in 16 ms. Remains 39 /85 variables (removed 46) and now considering 48/83 (removed 35) transitions.
[2022-05-19 12:26:49] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 39 cols
[2022-05-19 12:26:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 12:26:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-19 12:26:49] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 39 cols
[2022-05-19 12:26:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:26:49] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-19 12:26:49] [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 12:26:49] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:26:49] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 39 cols
[2022-05-19 12:26:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 12:26:49] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/85 places, 48/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/85 places, 48/83 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s31 1)), p0:(GEQ s13 1), p2:(AND (GEQ s1 1) (GEQ s31 1)), p3:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-14 finished in 345 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!((F(X(G(p0)))&&!p0) U F(p0)))))'
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 83/83 transitions.
Graph (complete) has 215 edges and 85 vertex of which 79 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 12 places
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 61 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 61 transition count 74
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 54 transition count 67
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 54 transition count 67
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 47 transition count 60
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 47 transition count 60
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 48 place count 40 transition count 53
Iterating global reduction 0 with 7 rules applied. Total rules applied 55 place count 40 transition count 53
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 61 place count 34 transition count 47
Iterating global reduction 0 with 6 rules applied. Total rules applied 67 place count 34 transition count 47
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 72 place count 29 transition count 42
Iterating global reduction 0 with 5 rules applied. Total rules applied 77 place count 29 transition count 42
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 82 place count 29 transition count 37
Applied a total of 82 rules in 11 ms. Remains 29 /85 variables (removed 56) and now considering 37/83 (removed 46) transitions.
[2022-05-19 12:26:49] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:26:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:26:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-19 12:26:49] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:26:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:26:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-19 12:26:49] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-19 12:26:49] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:26:49] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:26:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:26:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/85 places, 37/83 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/85 places, 37/83 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/29 stabilizing places and 8/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 37/37 transitions.
Applied a total of 0 rules in 5 ms. Remains 29 /29 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2022-05-19 12:26:50] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:26:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:26:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 12:26:50] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:26:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:26:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-19 12:26:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-19 12:26:50] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:26:50] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:26:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:26:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 37/37 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/29 stabilizing places and 8/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 19 ms :[p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Product exploration explored 100000 steps with 1 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Built C files in :
/tmp/ltsmin2239062605256953000
[2022-05-19 12:26:51] [INFO ] Computing symmetric may disable matrix : 37 transitions.
[2022-05-19 12:26:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:26:51] [INFO ] Computing symmetric may enable matrix : 37 transitions.
[2022-05-19 12:26:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:26:51] [INFO ] Computing Do-Not-Accords matrix : 37 transitions.
[2022-05-19 12:26:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:26:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2239062605256953000
Running compilation step : cd /tmp/ltsmin2239062605256953000;'/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 84 ms.
Running link step : cd /tmp/ltsmin2239062605256953000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin2239062605256953000;'/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/stateBased928381289395957580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2022-05-19 12:27:06] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:27:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:27:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-19 12:27:06] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:27:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:27:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-19 12:27:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-19 12:27:06] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-19 12:27:06] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 29 cols
[2022-05-19 12:27:06] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 12:27:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 37/37 transitions.
Built C files in :
/tmp/ltsmin3966909194873102649
[2022-05-19 12:27:06] [INFO ] Computing symmetric may disable matrix : 37 transitions.
[2022-05-19 12:27:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:27:06] [INFO ] Computing symmetric may enable matrix : 37 transitions.
[2022-05-19 12:27:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:27:06] [INFO ] Computing Do-Not-Accords matrix : 37 transitions.
[2022-05-19 12:27:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:27:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3966909194873102649
Running compilation step : cd /tmp/ltsmin3966909194873102649;'/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 82 ms.
Running link step : cd /tmp/ltsmin3966909194873102649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin3966909194873102649;'/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/stateBased5515865158589722915.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 12:27:21] [INFO ] Flatten gal took : 3 ms
[2022-05-19 12:27:21] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:27:21] [INFO ] Time to serialize gal into /tmp/LTL8826520489512607924.gal : 1 ms
[2022-05-19 12:27:21] [INFO ] Time to serialize properties into /tmp/LTL11819564418415651654.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/LTL8826520489512607924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11819564418415651654.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/LTL8826520...267
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((F(X(G("(p65>=1)"))))&&("(p65<1)"))U(F("(p65>=1)")))))))
Formula 0 simplified : !FX!(("(p65<1)" & FXG"(p65>=1)") U F"(p65>=1)")
Detected timeout of ITS tools.
[2022-05-19 12:27:36] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:27:36] [INFO ] Applying decomposition
[2022-05-19 12:27:36] [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/graph1980938910435507206.txt' '-o' '/tmp/graph1980938910435507206.bin' '-w' '/tmp/graph1980938910435507206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1980938910435507206.bin' '-l' '-1' '-v' '-w' '/tmp/graph1980938910435507206.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:27:36] [INFO ] Decomposing Gal with order
[2022-05-19 12:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:27:36] [INFO ] Removed a total of 7 redundant transitions.
[2022-05-19 12:27:36] [INFO ] Flatten gal took : 4 ms
[2022-05-19 12:27:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 0 ms.
[2022-05-19 12:27:36] [INFO ] Time to serialize gal into /tmp/LTL13752073051557777093.gal : 1 ms
[2022-05-19 12:27:36] [INFO ] Time to serialize properties into /tmp/LTL2095412670477430731.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/LTL13752073051557777093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2095412670477430731.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1375207...246
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((F(X(G("(u6.p65>=1)"))))&&("(u6.p65<1)"))U(F("(u6.p65>=1)")))))))
Formula 0 simplified : !FX!(("(u6.p65<1)" & FXG"(u6.p65>=1)") U F"(u6.p65>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5767538234736479677
[2022-05-19 12:27:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5767538234736479677
Running compilation step : cd /tmp/ltsmin5767538234736479677;'/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 71 ms.
Running link step : cd /tmp/ltsmin5767538234736479677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin5767538234736479677;'/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' '<>(X(!((<>(X([]((LTLAPp0==true))))&&!(LTLAPp0==true)) U <>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-15 finished in 76990 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!(p0 U p1))||(p0 U F(p2))||p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!((F(X(G(p0)))&&!p0) U F(p0)))))'
[2022-05-19 12:28:06] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10187567020300210914
[2022-05-19 12:28:06] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2022-05-19 12:28:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:28:06] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2022-05-19 12:28:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:28:06] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2022-05-19 12:28:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:28:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10187567020300210914
Running compilation step : cd /tmp/ltsmin10187567020300210914;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-05-19 12:28:06] [INFO ] Applying decomposition
[2022-05-19 12:28:06] [INFO ] Flatten gal took : 4 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/graph17646272627333508221.txt' '-o' '/tmp/graph17646272627333508221.bin' '-w' '/tmp/graph17646272627333508221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17646272627333508221.bin' '-l' '-1' '-v' '-w' '/tmp/graph17646272627333508221.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:28:06] [INFO ] Decomposing Gal with order
[2022-05-19 12:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:28:06] [INFO ] Removed a total of 20 redundant transitions.
[2022-05-19 12:28:06] [INFO ] Flatten gal took : 6 ms
[2022-05-19 12:28:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2022-05-19 12:28:06] [INFO ] Time to serialize gal into /tmp/LTLFireability6621942006662211023.gal : 2 ms
[2022-05-19 12:28:06] [INFO ] Time to serialize properties into /tmp/LTLFireability12263635742517808041.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/LTLFireability6621942006662211023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12263635742517808041.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(((F(!(("((i4.u8.p35>=1)&&(i4.u8.p114>=1))")U("(i2.u5.p58>=1)"))))||(("((i4.u8.p35>=1)&&(i4.u8.p114>=1))")U(F("(i9.u7.p55>=1)"))))...197
Formula 0 simplified : !G("((i4.u8.p35>=1)&&(i4.u8.p114>=1))" | F!("((i4.u8.p35>=1)&&(i4.u8.p114>=1))" U "(i2.u5.p58>=1)") | ("((i4.u8.p35>=1)&&(i4.u8.p114...183
Compilation finished in 127 ms.
Running link step : cd /tmp/ltsmin10187567020300210914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10187567020300210914;'/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' '--ltl' '[]((<>(!((LTLAPp0==true) U (LTLAPp1==true)))||((LTLAPp0==true) U <>((LTLAPp2==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: []((<>(!((LTLAPp0==true) U (LTLAPp1==true)))||((LTLAPp0==true) U <>((LTLAPp2==true)))||(LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.005: "[]((<>(!((LTLAPp0==true) U (LTLAPp1==true)))||((LTLAPp0==true) U <>((LTLAPp2==true)))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.022: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: Initializing POR dependencies: labels 87, guards 83
pins2lts-mc-linux64( 3/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.075: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.078: There are 88 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.078: State length is 86, there are 89 groups
pins2lts-mc-linux64( 0/ 8), 0.078: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.078: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.078: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.078: Visible groups: 0 / 89, labels: 3 / 88
pins2lts-mc-linux64( 0/ 8), 0.078: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.078: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.089: [Blue] ~120 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 0/ 8), 0.092: [Blue] ~240 levels ~1920 states ~2024 transitions
pins2lts-mc-linux64( 0/ 8), 0.215: [Blue] ~480 levels ~3840 states ~3944 transitions
pins2lts-mc-linux64( 0/ 8), 0.315: [Blue] ~960 levels ~7680 states ~7784 transitions
pins2lts-mc-linux64( 0/ 8), 0.626: [Blue] ~1920 levels ~15360 states ~15464 transitions
pins2lts-mc-linux64( 5/ 8), 1.027: [Blue] ~3838 levels ~30720 states ~30824 transitions
pins2lts-mc-linux64( 6/ 8), 1.443: [Blue] ~7679 levels ~61440 states ~61544 transitions
pins2lts-mc-linux64( 6/ 8), 1.996: [Blue] ~15359 levels ~122880 states ~122984 transitions
pins2lts-mc-linux64( 5/ 8), 2.842: [Blue] ~30718 levels ~245760 states ~245864 transitions
pins2lts-mc-linux64( 5/ 8), 4.618: [Blue] ~61438 levels ~491520 states ~491624 transitions
pins2lts-mc-linux64( 5/ 8), 5.681: [Blue] ~122878 levels ~983040 states ~983144 transitions
pins2lts-mc-linux64( 3/ 8), 7.252: [Blue] ~245760 levels ~1966080 states ~1966184 transitions
pins2lts-mc-linux64( 3/ 8), 10.252: [Blue] ~491520 levels ~3932160 states ~3932264 transitions
pins2lts-mc-linux64( 3/ 8), 17.015: [Blue] ~983040 levels ~7864320 states ~7864424 transitions
pins2lts-mc-linux64( 3/ 8), 19.807: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 19.911:
pins2lts-mc-linux64( 0/ 8), 19.911: Explored 7710169 states 7710286 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 19.911: Total exploration time 19.760 sec (19.640 sec minimum, 19.706 sec on average)
pins2lts-mc-linux64( 0/ 8), 19.911: States per second: 390191, Transitions per second: 390197
pins2lts-mc-linux64( 0/ 8), 19.911:
pins2lts-mc-linux64( 0/ 8), 19.911: State space has 6679409 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 19.911: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 19.911: blue states: 7710169 (115.43%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 19.911: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 19.911: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 19.911:
pins2lts-mc-linux64( 0/ 8), 19.911: Total memory used for local state coloring: 117.6MB
pins2lts-mc-linux64( 0/ 8), 19.911:
pins2lts-mc-linux64( 0/ 8), 19.911: Queue width: 8B, total height: 7710165, memory: 58.82MB
pins2lts-mc-linux64( 0/ 8), 19.911: Tree memory: 307.0MB, 48.2 B/state, compr.: 13.9%
pins2lts-mc-linux64( 0/ 8), 19.911: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 19.911: Stored 83 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 19.911: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 19.911: Est. total memory use: 365.8MB (~1082.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10187567020300210914;'/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' '--ltl' '[]((<>(!((LTLAPp0==true) U (LTLAPp1==true)))||((LTLAPp0==true) U <>((LTLAPp2==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10187567020300210914;'/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' '--ltl' '[]((<>(!((LTLAPp0==true) U (LTLAPp1==true)))||((LTLAPp0==true) U <>((LTLAPp2==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 12:49:03] [INFO ] Flatten gal took : 2 ms
[2022-05-19 12:49:03] [INFO ] Time to serialize gal into /tmp/LTLFireability7789061228555951489.gal : 3 ms
[2022-05-19 12:49:03] [INFO ] Time to serialize properties into /tmp/LTLFireability16083656731151131718.ltl : 1 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/LTLFireability7789061228555951489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16083656731151131718.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/LTLFireabi...289
Read 2 LTL properties
Checking formula 0 : !((G(((F(!(("((p35>=1)&&(p114>=1))")U("(p58>=1)"))))||(("((p35>=1)&&(p114>=1))")U(F("(p55>=1)"))))||("((p35>=1)&&(p114>=1))"))))
Formula 0 simplified : !G("((p35>=1)&&(p114>=1))" | F!("((p35>=1)&&(p114>=1))" U "(p58>=1)") | ("((p35>=1)&&(p114>=1))" U F"(p55>=1)"))
Detected timeout of ITS tools.
[2022-05-19 13:10:00] [INFO ] Flatten gal took : 88 ms
[2022-05-19 13:10:00] [INFO ] Input system was already deterministic with 83 transitions.
[2022-05-19 13:10:00] [INFO ] Transformed 85 places.
[2022-05-19 13:10:00] [INFO ] Transformed 83 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 13:10:00] [INFO ] Time to serialize gal into /tmp/LTLFireability9092825176448675849.gal : 12 ms
[2022-05-19 13:10:00] [INFO ] Time to serialize properties into /tmp/LTLFireability14753611081016778938.ltl : 3 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/LTLFireability9092825176448675849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14753611081016778938.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(((F(!(("((p35>=1)&&(p114>=1))")U("(p58>=1)"))))||(("((p35>=1)&&(p114>=1))")U(F("(p55>=1)"))))||("((p35>=1)&&(p114>=1))"))))
Formula 0 simplified : !G("((p35>=1)&&(p114>=1))" | F!("((p35>=1)&&(p114>=1))" U "(p58>=1)") | ("((p35>=1)&&(p114>=1))" U F"(p55>=1)"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S064P15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r204-oct2-165281599200364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S064P15.tgz
mv SemanticWebServices-PT-S064P15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;