fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r361-smll-167891811400364
Last Updated
May 14, 2023

About the Execution of LTSMin+red for SemanticWebServices-PT-S064P15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
413.283 45688.00 74845.00 746.50 FFF?FFFFFFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r361-smll-167891811400364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r361-smll-167891811400364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 137K Mar 5 18:23 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 1679230165544

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 12:49:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 12:49:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 12:49:28] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-19 12:49:28] [INFO ] Transformed 118 places.
[2023-03-19 12:49:28] [INFO ] Transformed 194 transitions.
[2023-03-19 12:49:28] [INFO ] Parsed PT model containing 118 places and 194 transitions and 1007 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2 places in 2 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-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 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 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 86 transition count 85
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 86 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 81 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 81 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 79 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 79 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 78 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 78 transition count 77
Applied a total of 52 rules in 69 ms. Remains 78 /116 variables (removed 38) and now considering 77/91 (removed 14) transitions.
[2023-03-19 12:49:29] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
// Phase 1: matrix 68 rows 78 cols
[2023-03-19 12:49:29] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-19 12:49:29] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-19 12:49:29] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-19 12:49:29] [INFO ] Invariant cache hit.
[2023-03-19 12:49:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 12:49:29] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-19 12:49:29] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-19 12:49:29] [INFO ] Invariant cache hit.
[2023-03-19 12:49:29] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/116 places, 77/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 78/116 places, 77/91 transitions.
Support contains 35 out of 78 places after structural reductions.
[2023-03-19 12:49:30] [INFO ] Flatten gal took : 46 ms
[2023-03-19 12:49:30] [INFO ] Flatten gal took : 19 ms
[2023-03-19 12:49:30] [INFO ] Input system was already deterministic with 77 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 12:49:30] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-19 12:49:30] [INFO ] Invariant cache hit.
[2023-03-19 12:49:30] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-19 12:49:31] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 12:49:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 12:49:31] [INFO ] After 19ms SMT Verify possible using 58 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-19 12:49:31] [INFO ] After 34ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 12:49:31] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 77/77 transitions.
Graph (complete) has 107 edges and 78 vertex of which 15 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.2 ms
Discarding 63 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Ensure Unique test removed 3 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 12 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 10 transition count 9
Applied a total of 23 rules in 14 ms. Remains 10 /78 variables (removed 68) and now considering 9/77 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 10/78 places, 9/77 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 11 stable transitions
Graph (complete) has 206 edges and 78 vertex of which 72 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Graph (complete) has 206 edges and 78 vertex of which 72 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 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 53 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 53 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 53 transition count 65
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 46 transition count 58
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 46 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 46 transition count 57
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 36 place count 41 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 41 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 36 transition count 47
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 36 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 36 transition count 46
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 32 transition count 42
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 32 transition count 42
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 30 transition count 40
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 30 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 30 transition count 38
Applied a total of 66 rules in 22 ms. Remains 30 /78 variables (removed 48) and now considering 38/77 (removed 39) transitions.
[2023-03-19 12:49:31] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
// Phase 1: matrix 32 rows 30 cols
[2023-03-19 12:49:31] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 12:49:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 12:49:31] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2023-03-19 12:49:31] [INFO ] Invariant cache hit.
[2023-03-19 12:49:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-19 12:49:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-19 12:49:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:49:31] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2023-03-19 12:49:31] [INFO ] Invariant cache hit.
[2023-03-19 12:49:31] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/78 places, 38/77 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 30/78 places, 38/77 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 1 reset in 3 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-00 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Graph (complete) has 206 edges and 78 vertex of which 72 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 54 transition count 67
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 54 transition count 67
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 47 transition count 60
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 47 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 47 transition count 59
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 42 transition count 54
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 42 transition count 54
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 37 transition count 49
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 37 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 37 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 33 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 33 transition count 44
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 31 transition count 42
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 31 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 31 transition count 40
Applied a total of 63 rules in 18 ms. Remains 31 /78 variables (removed 47) and now considering 40/77 (removed 37) transitions.
[2023-03-19 12:49:32] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
// Phase 1: matrix 34 rows 31 cols
[2023-03-19 12:49:32] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 12:49:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 12:49:32] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
[2023-03-19 12:49:32] [INFO ] Invariant cache hit.
[2023-03-19 12:49:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-19 12:49:32] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-19 12:49:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:49:32] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
[2023-03-19 12:49:32] [INFO ] Invariant cache hit.
[2023-03-19 12:49:32] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/78 places, 40/77 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 31/78 places, 40/77 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-01 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 s6 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]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-01 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||(p1&&F(p2))))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 64 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 64 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 64 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 61 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 61 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 61 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 59 transition count 66
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 59 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 57 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 57 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 57 transition count 63
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 56 transition count 62
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 56 transition count 62
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 55 transition count 61
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 55 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 55 transition count 60
Applied a total of 40 rules in 30 ms. Remains 55 /78 variables (removed 23) and now considering 60/77 (removed 17) transitions.
[2023-03-19 12:49:32] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 55 cols
[2023-03-19 12:49:32] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 12:49:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 12:49:32] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2023-03-19 12:49:32] [INFO ] Invariant cache hit.
[2023-03-19 12:49:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-19 12:49:32] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-19 12:49:32] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2023-03-19 12:49:32] [INFO ] Invariant cache hit.
[2023-03-19 12:49:32] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/78 places, 60/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 55/78 places, 60/77 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s6 1) (LT s54 1)), p0:(LT s31 1), p2:(AND (GEQ s7 1) (GEQ s47 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]]
Product exploration explored 100000 steps with 0 reset in 406 ms.
Product exploration explored 100000 steps with 0 reset in 423 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 119 edges and 55 vertex of which 49 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 681 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 12:49:35] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2023-03-19 12:49:35] [INFO ] Invariant cache hit.
[2023-03-19 12:49:35] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-19 12:49:35] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 12:49:35] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 12:49:35] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 12:49:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-19 12:49:35] [INFO ] After 16ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 12:49:35] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 12:49:35] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p0)), (F (AND (NOT p0) (NOT p2) p1)), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 922 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 12:49:36] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2023-03-19 12:49:36] [INFO ] Invariant cache hit.
[2023-03-19 12:49:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-19 12:49:36] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2023-03-19 12:49:36] [INFO ] Invariant cache hit.
[2023-03-19 12:49:36] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-19 12:49:36] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-19 12:49:36] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2023-03-19 12:49:36] [INFO ] Invariant cache hit.
[2023-03-19 12:49:36] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 55/55 places, 60/60 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 119 edges and 55 vertex of which 49 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 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 771 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 6) seen :5
Finished Best-First random walk after 3416 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=854 )
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p0)), (F (AND (NOT p0) (NOT p2) p1)), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 1049 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 366 ms.
Product exploration explored 100000 steps with 0 reset in 492 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 60/60 transitions.
Graph (complete) has 119 edges and 55 vertex of which 49 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 48 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 48 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 46 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 46 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 44 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 44 transition count 52
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 13 place count 42 transition count 50
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 42 transition count 50
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 40 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 40 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 39 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 39 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 39 transition count 46
Applied a total of 22 rules in 29 ms. Remains 39 /55 variables (removed 16) and now considering 46/60 (removed 14) transitions.
[2023-03-19 12:49:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:49:41] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 39 cols
[2023-03-19 12:49:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 12:49:41] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/55 places, 46/60 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 39/55 places, 46/60 transitions.
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 12:49:41] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 55 cols
[2023-03-19 12:49:41] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 12:49:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 12:49:41] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2023-03-19 12:49:41] [INFO ] Invariant cache hit.
[2023-03-19 12:49:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-19 12:49:41] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-19 12:49:41] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2023-03-19 12:49:41] [INFO ] Invariant cache hit.
[2023-03-19 12:49:41] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 55/55 places, 60/60 transitions.
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-02 finished in 9331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((p1||F(G(p2)))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 67 transition count 77
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 62 transition count 72
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 62 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 62 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 58 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 58 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 58 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 56 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 56 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 54 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 54 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 54 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 53 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 53 transition count 60
Applied a total of 42 rules in 16 ms. Remains 53 /78 variables (removed 25) and now considering 60/77 (removed 17) transitions.
[2023-03-19 12:49:41] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
// Phase 1: matrix 53 rows 53 cols
[2023-03-19 12:49:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 12:49:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 12:49:41] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:41] [INFO ] Invariant cache hit.
[2023-03-19 12:49:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 12:49:41] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-19 12:49:41] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:41] [INFO ] Invariant cache hit.
[2023-03-19 12:49:41] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/78 places, 60/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 53/78 places, 60/77 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s25 1), p1:(GEQ s14 1), p2:(OR (LT s6 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 34809 reset in 327 ms.
Product exploration explored 100000 steps with 34746 reset in 226 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 113 edges and 53 vertex of which 47 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/53 stabilizing places and 9/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 4 factoid took 329 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 6735 steps, including 2 resets, run visited all 2 properties in 25 ms. (steps per millisecond=269 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 430 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 12:49:43] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:43] [INFO ] Invariant cache hit.
[2023-03-19 12:49:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-19 12:49:43] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:43] [INFO ] Invariant cache hit.
[2023-03-19 12:49:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 12:49:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-19 12:49:43] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:43] [INFO ] Invariant cache hit.
[2023-03-19 12:49:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 53/53 places, 60/60 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 113 edges and 53 vertex of which 47 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/53 stabilizing places and 9/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 372 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 142 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 413 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 34798 reset in 178 ms.
Product exploration explored 100000 steps with 34832 reset in 213 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 60/60 transitions.
Graph (complete) has 113 edges and 53 vertex of which 48 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 5 ms. Remains 48 /53 variables (removed 5) and now considering 58/60 (removed 2) transitions.
[2023-03-19 12:49:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:49:45] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 48 cols
[2023-03-19 12:49:45] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-19 12:49:45] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/53 places, 58/60 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 48/53 places, 58/60 transitions.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 12:49:45] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
// Phase 1: matrix 53 rows 53 cols
[2023-03-19 12:49:45] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-19 12:49:45] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 12:49:45] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:45] [INFO ] Invariant cache hit.
[2023-03-19 12:49:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 12:49:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-19 12:49:46] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:46] [INFO ] Invariant cache hit.
[2023-03-19 12:49:46] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 53/53 places, 60/60 transitions.
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-03 finished in 4559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 67 transition count 77
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 61 transition count 71
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 61 transition count 70
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 56 transition count 65
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 56 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 56 transition count 64
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 53 transition count 61
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 53 transition count 61
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 50 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 50 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 50 transition count 57
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 50 place count 48 transition count 55
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 48 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 47 transition count 54
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 47 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 47 transition count 53
Applied a total of 55 rules in 16 ms. Remains 47 /78 variables (removed 31) and now considering 53/77 (removed 24) transitions.
[2023-03-19 12:49:46] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
// Phase 1: matrix 47 rows 47 cols
[2023-03-19 12:49:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 12:49:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 12:49:46] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2023-03-19 12:49:46] [INFO ] Invariant cache hit.
[2023-03-19 12:49:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-19 12:49:46] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-19 12:49:46] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2023-03-19 12:49:46] [INFO ] Invariant cache hit.
[2023-03-19 12:49:46] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/78 places, 53/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 47/78 places, 53/77 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s43 1)), p0:(GEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-04 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(((!p0 U p1)||G(p2))))&&F(p1)))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 77
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 63 transition count 72
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 63 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 63 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 59 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 59 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 59 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 57 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 57 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 55 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 55 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 55 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 54 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 54 transition count 60
Applied a total of 41 rules in 13 ms. Remains 54 /78 variables (removed 24) and now considering 60/77 (removed 17) transitions.
[2023-03-19 12:49:46] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
// Phase 1: matrix 53 rows 54 cols
[2023-03-19 12:49:46] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 12:49:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 12:49:46] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:46] [INFO ] Invariant cache hit.
[2023-03-19 12:49:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 12:49:46] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-19 12:49:46] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:46] [INFO ] Invariant cache hit.
[2023-03-19 12:49:46] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/78 places, 60/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 54/78 places, 60/77 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s16 1), p0:(OR (LT s7 1) (LT s42 1)), p2:(AND (GEQ s6 1) (GEQ s47 1) (GEQ s52 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, null, null][false, false, 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-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-05 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Graph (complete) has 206 edges and 78 vertex of which 72 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 54 transition count 67
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 54 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 54 transition count 66
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 48 transition count 60
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 48 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 43 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 43 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 38 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 38 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 38 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 34 transition count 45
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 34 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 32 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 32 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 32 transition count 41
Applied a total of 61 rules in 20 ms. Remains 32 /78 variables (removed 46) and now considering 41/77 (removed 36) transitions.
[2023-03-19 12:49:47] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
// Phase 1: matrix 34 rows 32 cols
[2023-03-19 12:49:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 12:49:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 12:49:47] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2023-03-19 12:49:47] [INFO ] Invariant cache hit.
[2023-03-19 12:49:47] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-19 12:49:47] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-19 12:49:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:49:47] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2023-03-19 12:49:47] [INFO ] Invariant cache hit.
[2023-03-19 12:49:47] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/78 places, 41/77 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 32/78 places, 41/77 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-06 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 s24 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 369 ms.
Product exploration explored 100000 steps with 0 reset in 668 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-19 12:49:48] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2023-03-19 12:49:48] [INFO ] Invariant cache hit.
[2023-03-19 12:49:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 12:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:49:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-19 12:49:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:49:48] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 12:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:49:48] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-19 12:49:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-19 12:49:48] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2023-03-19 12:49:48] [INFO ] Computed and/alt/rep : 29/37/22 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-19 12:49:48] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 41/41 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-19 12:49:49] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2023-03-19 12:49:49] [INFO ] Invariant cache hit.
[2023-03-19 12:49:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 12:49:49] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2023-03-19 12:49:49] [INFO ] Invariant cache hit.
[2023-03-19 12:49:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-19 12:49:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 12:49:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 12:49:49] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2023-03-19 12:49:49] [INFO ] Invariant cache hit.
[2023-03-19 12:49:49] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 32/32 places, 41/41 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
[2023-03-19 12:49:49] [INFO ] Flow matrix only has 34 transitions (discarded 7 similar events)
[2023-03-19 12:49:49] [INFO ] Invariant cache hit.
[2023-03-19 12:49:49] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 12:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:49:49] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-19 12:49:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:49:49] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 12:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:49:49] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-19 12:49:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-19 12:49:49] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2023-03-19 12:49:49] [INFO ] Computed and/alt/rep : 29/37/22 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-19 12:49:49] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 245 ms.
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-06 finished in 3120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&G((X((p0 U p1)) U (p2 U p3)))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 77
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 63 transition count 72
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 63 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 63 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 59 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 59 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 56 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 56 transition count 64
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 53 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 53 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 53 transition count 60
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 51 transition count 58
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 51 transition count 58
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 50 transition count 57
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 50 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 50 transition count 56
Applied a total of 49 rules in 13 ms. Remains 50 /78 variables (removed 28) and now considering 56/77 (removed 21) transitions.
[2023-03-19 12:49:50] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 50 cols
[2023-03-19 12:49:50] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 12:49:50] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 12:49:50] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2023-03-19 12:49:50] [INFO ] Invariant cache hit.
[2023-03-19 12:49:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-19 12:49:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-19 12:49:50] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2023-03-19 12:49:50] [INFO ] Invariant cache hit.
[2023-03-19 12:49:50] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/78 places, 56/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 50/78 places, 56/77 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), true, (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 (NOT p3) p2) (AND (NOT p3) p2 p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s5 1), p3:(AND (GEQ s6 1) (GEQ s39 1)), p2:(AND (GEQ s7 1) (GEQ s43 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 595 ms.
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-07 finished in 1202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||G((X(G(p2))&&p1))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 67 transition count 77
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 62 transition count 72
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 62 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 62 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 58 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 58 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 58 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 56 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 56 transition count 64
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 55 transition count 63
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 55 transition count 63
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 54 transition count 62
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 54 transition count 62
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 53 transition count 61
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 53 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 53 transition count 60
Applied a total of 42 rules in 11 ms. Remains 53 /78 variables (removed 25) and now considering 60/77 (removed 17) transitions.
[2023-03-19 12:49:51] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
// Phase 1: matrix 53 rows 53 cols
[2023-03-19 12:49:51] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 12:49:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 12:49:51] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:51] [INFO ] Invariant cache hit.
[2023-03-19 12:49:51] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 12:49:51] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-19 12:49:51] [INFO ] Flow matrix only has 53 transitions (discarded 7 similar events)
[2023-03-19 12:49:51] [INFO ] Invariant cache hit.
[2023-03-19 12:49:51] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/78 places, 60/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 53/78 places, 60/77 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (GEQ s6 1) (GEQ s43 1)), p0:(OR (AND (GEQ s6 1) (GEQ s43 1)) (GEQ s18 1)), p2:(GEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 399 ms.
Stuttering criterion allowed to conclude after 86 steps with 4 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-08 finished in 844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X(G(p1)))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 77
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 63 transition count 72
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 63 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 63 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 59 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 59 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 59 transition count 66
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 57 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 57 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 55 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 55 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 55 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 54 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 54 transition count 60
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 53 transition count 59
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 53 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 53 transition count 58
Applied a total of 44 rules in 11 ms. Remains 53 /78 variables (removed 25) and now considering 58/77 (removed 19) transitions.
[2023-03-19 12:49:52] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 53 cols
[2023-03-19 12:49:52] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 12:49:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 12:49:52] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2023-03-19 12:49:52] [INFO ] Invariant cache hit.
[2023-03-19 12:49:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-19 12:49:52] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-19 12:49:52] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2023-03-19 12:49:52] [INFO ] Invariant cache hit.
[2023-03-19 12:49:52] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/78 places, 58/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 53/78 places, 58/77 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s6 1) (LT s52 1)), p1:(AND (GEQ s7 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-10 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U (p1 U G(p2)))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 68 transition count 77
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 62 transition count 71
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 62 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 62 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 58 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 58 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 58 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 56 transition count 63
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 56 transition count 63
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 54 transition count 61
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 54 transition count 61
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 53 transition count 60
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 53 transition count 60
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 52 transition count 59
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 52 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 52 transition count 58
Applied a total of 45 rules in 5 ms. Remains 52 /78 variables (removed 26) and now considering 58/77 (removed 19) transitions.
[2023-03-19 12:49:52] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 52 cols
[2023-03-19 12:49:52] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 12:49:52] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 12:49:52] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:49:52] [INFO ] Invariant cache hit.
[2023-03-19 12:49:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 12:49:52] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-19 12:49:52] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:49:52] [INFO ] Invariant cache hit.
[2023-03-19 12:49:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/78 places, 58/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 52/78 places, 58/77 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s37 1)), p1:(GEQ s25 1), p0:(AND (GEQ s6 1) (GEQ s48 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 1 reset in 536 ms.
Product exploration explored 100000 steps with 8 reset in 550 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.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/52 stabilizing places and 9/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 1058 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
Finished random walk after 3339 steps, including 1 resets, run visited all 10 properties in 23 ms. (steps per millisecond=145 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p0), (F (AND p2 (NOT p1))), (F (OR p2 p1)), (F (OR (AND p2 p0) (AND p1 p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p1 p0)), (F (AND p2 p1))]
Knowledge based reduction with 12 factoid took 1469 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
[2023-03-19 12:49:57] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:49:57] [INFO ] Invariant cache hit.
[2023-03-19 12:49:57] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 12:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:49:57] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-19 12:49:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:49:58] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 12:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:49:58] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-19 12:49:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 12:49:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 7 ms returned sat
[2023-03-19 12:49:58] [INFO ] Computed and/alt/rep : 54/68/47 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 12:49:58] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-19 12:49:58] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:49:58] [INFO ] Invariant cache hit.
[2023-03-19 12:49:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 12:49:58] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:49:58] [INFO ] Invariant cache hit.
[2023-03-19 12:49:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 12:49:58] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-19 12:49:58] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:49:58] [INFO ] Invariant cache hit.
[2023-03-19 12:49:58] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 52/52 places, 58/58 transitions.
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.2 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/52 stabilizing places and 9/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 1078 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) 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 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p0), (F (AND p2 (NOT p1))), (F (OR p2 p1)), (F (OR (AND p2 p0) (AND p1 p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p1 p0)), (F (AND p2 p1))]
Knowledge based reduction with 12 factoid took 1388 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
[2023-03-19 12:50:01] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:01] [INFO ] Invariant cache hit.
[2023-03-19 12:50:01] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 12:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 12:50:01] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-19 12:50:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 12:50:01] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 12:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 12:50:01] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-19 12:50:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 12:50:01] [INFO ] [Nat]Added 42 Read/Feed constraints in 7 ms returned sat
[2023-03-19 12:50:01] [INFO ] Computed and/alt/rep : 54/68/47 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 12:50:02] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 0 reset in 422 ms.
Product exploration explored 100000 steps with 4 reset in 433 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 58/58 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.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 45 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 43 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 43 transition count 52
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 41 transition count 50
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 41 transition count 50
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 13 place count 39 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 39 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 37 transition count 46
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 37 transition count 46
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 35 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 35 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 25 place count 35 transition count 42
Applied a total of 25 rules in 19 ms. Remains 35 /52 variables (removed 17) and now considering 42/58 (removed 16) transitions.
[2023-03-19 12:50:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 12:50:03] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 35 cols
[2023-03-19 12:50:03] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 12:50:03] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/52 places, 42/58 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 35/52 places, 42/58 transitions.
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 58/58 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-19 12:50:03] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 52 cols
[2023-03-19 12:50:03] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-19 12:50:03] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 12:50:03] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:03] [INFO ] Invariant cache hit.
[2023-03-19 12:50:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-19 12:50:03] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-19 12:50:03] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:03] [INFO ] Invariant cache hit.
[2023-03-19 12:50:03] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 52/52 places, 58/58 transitions.
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-14 finished in 11180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||(p1&&F(p2))))))'
Found a Lengthening insensitive property : SemanticWebServices-PT-S064P15-LTLFireability-02
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Graph (complete) has 206 edges and 78 vertex of which 72 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 10 places
Reduce places removed 11 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 56 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 56 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 51 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 51 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 51 transition count 61
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 47 transition count 57
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 47 transition count 57
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 43 transition count 53
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 43 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 43 transition count 52
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 40 transition count 49
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 40 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 39 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 39 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 39 transition count 47
Applied a total of 49 rules in 20 ms. Remains 39 /78 variables (removed 39) and now considering 47/77 (removed 30) transitions.
[2023-03-19 12:50:04] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
// Phase 1: matrix 40 rows 39 cols
[2023-03-19 12:50:04] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 12:50:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 12:50:04] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
[2023-03-19 12:50:04] [INFO ] Invariant cache hit.
[2023-03-19 12:50:04] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-19 12:50:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-19 12:50:04] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
[2023-03-19 12:50:04] [INFO ] Invariant cache hit.
[2023-03-19 12:50:04] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 39/78 places, 47/77 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 175 ms. Remains : 39/78 places, 47/77 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s38 1)), p0:(LT s20 1), p2:(AND (GEQ s2 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 638 ms.
Entered a terminal (fully accepting) state of product in 116 steps with 0 reset in 2 ms.
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-02 finished in 1101 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((p1||F(G(p2)))))))'
Found a Shortening insensitive property : SemanticWebServices-PT-S064P15-LTLFireability-03
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Graph (complete) has 206 edges and 78 vertex of which 73 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 places
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 57 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 57 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 57 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 53 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 53 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 21 place count 53 transition count 64
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 51 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 51 transition count 62
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 49 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 49 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 49 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 48 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 48 transition count 58
Applied a total of 32 rules in 15 ms. Remains 48 /78 variables (removed 30) and now considering 58/77 (removed 19) transitions.
[2023-03-19 12:50:05] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 48 cols
[2023-03-19 12:50:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 12:50:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 12:50:05] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:05] [INFO ] Invariant cache hit.
[2023-03-19 12:50:05] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 12:50:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-19 12:50:05] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:05] [INFO ] Invariant cache hit.
[2023-03-19 12:50:05] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 48/78 places, 58/77 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 205 ms. Remains : 48/78 places, 58/77 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s20 1), p1:(GEQ s10 1), p2:(OR (LT s2 1) (LT s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 34807 reset in 105 ms.
Product exploration explored 100000 steps with 34780 reset in 116 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Graph (complete) has 105 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/48 stabilizing places and 8/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 4 factoid took 347 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 93 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 388 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-19 12:50:06] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:06] [INFO ] Invariant cache hit.
[2023-03-19 12:50:06] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 12:50:06] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:06] [INFO ] Invariant cache hit.
[2023-03-19 12:50:06] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 12:50:06] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-19 12:50:06] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:06] [INFO ] Invariant cache hit.
[2023-03-19 12:50:06] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 48/48 places, 58/58 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Graph (complete) has 105 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/48 stabilizing places and 8/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 351 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 6680 steps, including 2 resets, run visited all 2 properties in 18 ms. (steps per millisecond=371 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 4 factoid took 420 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 34707 reset in 187 ms.
Product exploration explored 100000 steps with 34777 reset in 205 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 58/58 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-19 12:50:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 12:50:08] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:08] [INFO ] Invariant cache hit.
[2023-03-19 12:50:08] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 48/48 places, 58/58 transitions.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 58/58 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2023-03-19 12:50:08] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:08] [INFO ] Invariant cache hit.
[2023-03-19 12:50:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 12:50:08] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:08] [INFO ] Invariant cache hit.
[2023-03-19 12:50:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-19 12:50:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-19 12:50:08] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2023-03-19 12:50:08] [INFO ] Invariant cache hit.
[2023-03-19 12:50:09] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 48/48 places, 58/58 transitions.
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-03 finished in 4056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U (p1 U G(p2)))))'
Found a Lengthening insensitive property : SemanticWebServices-PT-S064P15-LTLFireability-14
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 (NOT p2) p1)]
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 78/78 places, 77/77 transitions.
Graph (complete) has 206 edges and 78 vertex of which 72 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 10 places
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 55 transition count 67
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 55 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 55 transition count 66
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 49 transition count 60
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 49 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 49 transition count 59
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 45 transition count 55
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 45 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 41 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 41 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 38 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 38 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 36 transition count 46
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 36 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 36 transition count 44
Applied a total of 57 rules in 19 ms. Remains 36 /78 variables (removed 42) and now considering 44/77 (removed 33) transitions.
[2023-03-19 12:50:09] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
// Phase 1: matrix 37 rows 36 cols
[2023-03-19 12:50:09] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-19 12:50:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 12:50:09] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
[2023-03-19 12:50:09] [INFO ] Invariant cache hit.
[2023-03-19 12:50:09] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-19 12:50:09] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-19 12:50:09] [INFO ] Flow matrix only has 37 transitions (discarded 7 similar events)
[2023-03-19 12:50:09] [INFO ] Invariant cache hit.
[2023-03-19 12:50:09] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 36/78 places, 44/77 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 193 ms. Remains : 36/78 places, 44/77 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s25 1)), p1:(GEQ s17 1), p0:(AND (GEQ s2 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 46 steps with 2 reset in 0 ms.
Treatment of property SemanticWebServices-PT-S064P15-LTLFireability-14 finished in 682 ms.
FORMULA SemanticWebServices-PT-S064P15-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 12:50:09] [INFO ] Flatten gal took : 10 ms
[2023-03-19 12:50:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-19 12:50:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 77 transitions and 273 arcs took 3 ms.
Total runtime 41372 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2180/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2180/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2180/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SemanticWebServices-PT-S064P15-LTLFireability-02
Could not compute solution for formula : SemanticWebServices-PT-S064P15-LTLFireability-03
Could not compute solution for formula : SemanticWebServices-PT-S064P15-LTLFireability-14

BK_STOP 1679230211232

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SemanticWebServices-PT-S064P15-LTLFireability-02
ltl formula formula --ltl=/tmp/2180/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 78 places, 77 transitions and 273 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2180/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2180/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2180/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2180/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name SemanticWebServices-PT-S064P15-LTLFireability-03
ltl formula formula --ltl=/tmp/2180/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 78 places, 77 transitions and 273 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2180/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2180/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2180/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2180/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564b369b53f4]
1: pnml2lts-mc(+0xa2496) [0x564b369b5496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2958a3f140]
3: pnml2lts-mc(+0x405be5) [0x564b36d18be5]
4: pnml2lts-mc(+0x16b3f9) [0x564b36a7e3f9]
5: pnml2lts-mc(+0x164ac4) [0x564b36a77ac4]
6: pnml2lts-mc(+0x272e0a) [0x564b36b85e0a]
7: pnml2lts-mc(+0xb61f0) [0x564b369c91f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f29588924d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f295889267a]
10: pnml2lts-mc(+0xa1581) [0x564b369b4581]
11: pnml2lts-mc(+0xa1910) [0x564b369b4910]
12: pnml2lts-mc(+0xa32a2) [0x564b369b62a2]
13: pnml2lts-mc(+0xa50f4) [0x564b369b80f4]
14: pnml2lts-mc(+0xa516b) [0x564b369b816b]
15: pnml2lts-mc(+0x3f34b3) [0x564b36d064b3]
16: pnml2lts-mc(+0x7c63d) [0x564b3698f63d]
17: pnml2lts-mc(+0x67d86) [0x564b3697ad86]
18: pnml2lts-mc(+0x60a8a) [0x564b36973a8a]
19: pnml2lts-mc(+0x5eb15) [0x564b36971b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f295887ad0a]
21: pnml2lts-mc(+0x6075e) [0x564b3697375e]
ltl formula name SemanticWebServices-PT-S064P15-LTLFireability-14
ltl formula formula --ltl=/tmp/2180/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 78 places, 77 transitions and 273 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2180/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2180/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2180/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2180/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5557f7f203f4]
1: pnml2lts-mc(+0xa2496) [0x5557f7f20496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f706d27b140]
3: pnml2lts-mc(+0x405be5) [0x5557f8283be5]
4: pnml2lts-mc(+0x16b3f9) [0x5557f7fe93f9]
5: pnml2lts-mc(+0x164ac4) [0x5557f7fe2ac4]
6: pnml2lts-mc(+0x272e0a) [0x5557f80f0e0a]
7: pnml2lts-mc(+0xb61f0) [0x5557f7f341f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f706d0ce4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f706d0ce67a]
10: pnml2lts-mc(+0xa1581) [0x5557f7f1f581]
11: pnml2lts-mc(+0xa1910) [0x5557f7f1f910]
12: pnml2lts-mc(+0xa32a2) [0x5557f7f212a2]
13: pnml2lts-mc(+0xa50f4) [0x5557f7f230f4]
14: pnml2lts-mc(+0xa516b) [0x5557f7f2316b]
15: pnml2lts-mc(+0x3f34b3) [0x5557f82714b3]
16: pnml2lts-mc(+0x7c63d) [0x5557f7efa63d]
17: pnml2lts-mc(+0x67d86) [0x5557f7ee5d86]
18: pnml2lts-mc(+0x60a8a) [0x5557f7edea8a]
19: pnml2lts-mc(+0x5eb15) [0x5557f7edcb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f706d0b6d0a]
21: pnml2lts-mc(+0x6075e) [0x5557f7ede75e]

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r361-smll-167891811400364"
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 ;