About the Execution of LTSMin+red for SemanticWebServices-PT-S064P18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 466.676 | 46471.00 | 72610.00 | 866.30 | ?TT?FFFTFFFFFTF? | 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-167891811400371.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-S064P18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811400371
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 10:22 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 173K 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-S064P18-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679233838151
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 13:50:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:50:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:50:41] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-19 13:50:41] [INFO ] Transformed 154 places.
[2023-03-19 13:50:41] [INFO ] Transformed 236 transitions.
[2023-03-19 13:50:41] [INFO ] Parsed PT model containing 154 places and 236 transitions and 1265 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 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 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 112/112 transitions.
Ensure Unique test removed 46 places
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 104 transition count 112
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 98 transition count 106
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 98 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 98 transition count 105
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 94 transition count 101
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 94 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 93 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 93 transition count 100
Applied a total of 71 rules in 38 ms. Remains 93 /152 variables (removed 59) and now considering 100/112 (removed 12) transitions.
[2023-03-19 13:50:41] [INFO ] Flow matrix only has 91 transitions (discarded 9 similar events)
// Phase 1: matrix 91 rows 93 cols
[2023-03-19 13:50:41] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-19 13:50:42] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-19 13:50:42] [INFO ] Flow matrix only has 91 transitions (discarded 9 similar events)
[2023-03-19 13:50:42] [INFO ] Invariant cache hit.
[2023-03-19 13:50:42] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-19 13:50:42] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-03-19 13:50:42] [INFO ] Flow matrix only has 91 transitions (discarded 9 similar events)
[2023-03-19 13:50:42] [INFO ] Invariant cache hit.
[2023-03-19 13:50:42] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/152 places, 100/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 809 ms. Remains : 93/152 places, 100/112 transitions.
Support contains 37 out of 93 places after structural reductions.
[2023-03-19 13:50:42] [INFO ] Flatten gal took : 38 ms
[2023-03-19 13:50:42] [INFO ] Flatten gal took : 15 ms
[2023-03-19 13:50:42] [INFO ] Input system was already deterministic with 100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 26) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:50:43] [INFO ] Flow matrix only has 91 transitions (discarded 9 similar events)
[2023-03-19 13:50:43] [INFO ] Invariant cache hit.
[2023-03-19 13:50:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-19 13:50:43] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 201 edges and 93 vertex of which 87 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(G(p0)))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Ensure Unique test removed 3 places
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 90 transition count 98
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 88 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 84 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 84 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 80 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 76 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 76 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 72 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 72 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 69 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 69 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 66 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 66 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 66 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 65 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 65 transition count 73
Applied a total of 52 rules in 60 ms. Remains 65 /93 variables (removed 28) and now considering 73/100 (removed 27) transitions.
[2023-03-19 13:50:44] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
// Phase 1: matrix 66 rows 65 cols
[2023-03-19 13:50:44] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 13:50:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 13:50:44] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2023-03-19 13:50:44] [INFO ] Invariant cache hit.
[2023-03-19 13:50:44] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:50:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-19 13:50:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:50:44] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2023-03-19 13:50:44] [INFO ] Invariant cache hit.
[2023-03-19 13:50:44] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/93 places, 73/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 65/93 places, 73/100 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s12 s2) (LEQ s37 s0))], 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 631 ms.
Product exploration explored 100000 steps with 2 reset in 755 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 136 edges and 65 vertex of which 61 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 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 37 ms :[(NOT p0)]
Finished random walk after 6827 steps, including 2 resets, run visited all 1 properties in 24 ms. (steps per millisecond=284 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 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 39 ms :[(NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 73/73 transitions.
Applied a total of 0 rules in 7 ms. Remains 65 /65 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-19 13:50:46] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2023-03-19 13:50:46] [INFO ] Invariant cache hit.
[2023-03-19 13:50:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 13:50:46] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2023-03-19 13:50:46] [INFO ] Invariant cache hit.
[2023-03-19 13:50:46] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:50:46] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-19 13:50:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:50:46] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2023-03-19 13:50:46] [INFO ] Invariant cache hit.
[2023-03-19 13:50:46] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 65/65 places, 73/73 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 136 edges and 65 vertex of which 61 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 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)]
Finished random walk after 243 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=81 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 214 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 446 ms.
Product exploration explored 100000 steps with 0 reset in 200 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 73/73 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-19 13:50:47] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2023-03-19 13:50:47] [INFO ] Invariant cache hit.
[2023-03-19 13:50:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 13:50:47] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2023-03-19 13:50:47] [INFO ] Invariant cache hit.
[2023-03-19 13:50:47] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:50:47] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-19 13:50:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:50:48] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
[2023-03-19 13:50:48] [INFO ] Invariant cache hit.
[2023-03-19 13:50:48] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 65/65 places, 73/73 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-00 finished in 4194 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(p1))) U ((X((p0||X(p1)))&&(G(!p0)||G(p2)))||X(G((p0||X(p1)))))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 85 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 85 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 81 transition count 91
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 81 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 77 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 77 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 74 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 74 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 71 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 71 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 68 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 68 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 68 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 67 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 67 transition count 75
Applied a total of 51 rules in 14 ms. Remains 67 /93 variables (removed 26) and now considering 75/100 (removed 25) transitions.
[2023-03-19 13:50:48] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
// Phase 1: matrix 68 rows 67 cols
[2023-03-19 13:50:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 13:50:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 13:50:48] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2023-03-19 13:50:48] [INFO ] Invariant cache hit.
[2023-03-19 13:50:48] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:50:48] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-19 13:50:48] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2023-03-19 13:50:48] [INFO ] Invariant cache hit.
[2023-03-19 13:50:48] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/93 places, 75/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 67/93 places, 75/100 transitions.
Stuttering acceptance computed with spot in 924 ms :[(AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), true, false, false, false, false, (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), p0, (NOT p2), (AND p0 (NOT p2) p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=1 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={2} source=1 dest: 9}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1, 2} source=2 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={2} source=2 dest: 9}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 11}], [{ cond=true, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=3 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={2} source=3 dest: 9}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=4 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={2} source=4 dest: 9}, { cond=p2, acceptance={} source=4 dest: 11}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0, 1, 2} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 12}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1, 2} source=8 dest: 8}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={2} source=8 dest: 9}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=9 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1, 2} source=9 dest: 8}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={2} source=9 dest: 9}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=9 dest: 10}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 14}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 15}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=13 dest: 15}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=13 dest: 16}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=13 dest: 17}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=14 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=14 dest: 16}], [{ cond=p0, acceptance={} source=15 dest: 6}, { cond=(NOT p0), acceptance={} source=15 dest: 15}], [{ cond=(NOT p2), acceptance={} source=16 dest: 6}, { cond=p2, acceptance={} source=16 dest: 16}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=17 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=17 dest: 15}, { cond=(AND p0 p2 p1), acceptance={} source=17 dest: 16}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=17 dest: 17}]], initial=3, aps=[p0:(GT s66 s12), p1:(LEQ s48 s14), p2:(GT 1 s11)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33475 reset in 336 ms.
Product exploration explored 100000 steps with 33424 reset in 254 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 138 edges and 67 vertex of which 61 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 (NOT p0) p1 p2), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 3665 ms. Reduced automaton from 18 states, 75 edges and 3 AP (stutter sensitive) to 18 states, 75 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 791 ms :[(AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), true, false, false, false, false, (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), p0, (NOT p2), (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 7) seen :3
Running SMT prover for 4 properties.
[2023-03-19 13:50:54] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2023-03-19 13:50:54] [INFO ] Invariant cache hit.
[2023-03-19 13:50:55] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 13:50:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 13:50:55] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-19 13:50:55] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:50:55] [INFO ] After 14ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-03-19 13:50:55] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 13:50:55] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 75/75 transitions.
Graph (complete) has 78 edges and 67 vertex of which 20 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 20 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 18 transition count 18
Applied a total of 13 rules in 11 ms. Remains 18 /67 variables (removed 49) and now considering 18/75 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 18/67 places, 18/75 transitions.
Finished random walk after 1300 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=130 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F p0), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 42 factoid took 4186 ms. Reduced automaton from 18 states, 75 edges and 3 AP (stutter sensitive) to 14 states, 52 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 576 ms :[(AND (NOT p0) (NOT p1)), false, false, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p1), true, false, (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 574 ms :[(AND (NOT p0) (NOT p1)), false, false, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p1), true, false, (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 p1)]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-19 13:51:00] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2023-03-19 13:51:00] [INFO ] Invariant cache hit.
[2023-03-19 13:51:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 13:51:00] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2023-03-19 13:51:00] [INFO ] Invariant cache hit.
[2023-03-19 13:51:00] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:51:00] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-19 13:51:00] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2023-03-19 13:51:00] [INFO ] Invariant cache hit.
[2023-03-19 13:51:00] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 67/67 places, 75/75 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 138 edges and 67 vertex of which 61 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), true, (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 2274 ms. Reduced automaton from 14 states, 52 edges and 3 AP (stutter sensitive) to 14 states, 52 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 559 ms :[(AND (NOT p0) (NOT p1)), false, false, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p1), true, false, (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 14) seen :10
Finished Best-First random walk after 1221 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=407 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), true, (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND p1 p2))), (F (NOT (AND (NOT p0) p1 p2))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 25 factoid took 2512 ms. Reduced automaton from 14 states, 52 edges and 3 AP (stutter sensitive) to 14 states, 52 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 698 ms :[(AND (NOT p0) (NOT p1)), false, false, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p1), true, false, (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 543 ms :[(AND (NOT p0) (NOT p1)), false, false, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p1), true, false, (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 561 ms :[(AND (NOT p0) (NOT p1)), false, false, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p1), true, false, (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 33476 reset in 198 ms.
Product exploration explored 100000 steps with 33493 reset in 183 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 542 ms :[(AND (NOT p0) (NOT p1)), false, false, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p1), true, false, (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 p1)]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Graph (complete) has 138 edges and 67 vertex of which 61 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 60 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 60 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 59 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 59 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 58 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 58 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 57 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 57 transition count 68
Applied a total of 9 rules in 16 ms. Remains 57 /67 variables (removed 10) and now considering 68/75 (removed 7) transitions.
[2023-03-19 13:51:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 13:51:09] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
// Phase 1: matrix 60 rows 57 cols
[2023-03-19 13:51:09] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-19 13:51:09] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/67 places, 68/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 57/67 places, 68/75 transitions.
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-19 13:51:09] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
// Phase 1: matrix 68 rows 67 cols
[2023-03-19 13:51:09] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 13:51:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-19 13:51:09] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2023-03-19 13:51:09] [INFO ] Invariant cache hit.
[2023-03-19 13:51:09] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-19 13:51:09] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-19 13:51:09] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2023-03-19 13:51:09] [INFO ] Invariant cache hit.
[2023-03-19 13:51:09] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 67/67 places, 75/75 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-03 finished in 21835 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 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Graph (complete) has 201 edges and 93 vertex of which 87 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 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 77 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 77 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 72 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 72 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 28 place count 67 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 67 transition count 80
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 38 place count 62 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 62 transition count 75
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 47 place count 58 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 51 place count 58 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 56 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 56 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 57 place count 56 transition count 67
Applied a total of 57 rules in 22 ms. Remains 56 /93 variables (removed 37) and now considering 67/100 (removed 33) transitions.
[2023-03-19 13:51:10] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
// Phase 1: matrix 59 rows 56 cols
[2023-03-19 13:51:10] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 13:51:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 13:51:10] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2023-03-19 13:51:10] [INFO ] Invariant cache hit.
[2023-03-19 13:51:10] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-19 13:51:10] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-19 13:51:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:10] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2023-03-19 13:51:10] [INFO ] Invariant cache hit.
[2023-03-19 13:51:10] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/93 places, 67/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 56/93 places, 67/100 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s1)], 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 322 ms.
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-04 finished in 653 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 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Graph (complete) has 201 edges and 93 vertex of which 87 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 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 77 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 77 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 71 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 71 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 65 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 65 transition count 78
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 42 place count 60 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 47 place count 60 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 51 place count 56 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 55 place count 56 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 57 place count 54 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 54 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 61 place count 54 transition count 65
Applied a total of 61 rules in 17 ms. Remains 54 /93 variables (removed 39) and now considering 65/100 (removed 35) transitions.
[2023-03-19 13:51:10] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
// Phase 1: matrix 57 rows 54 cols
[2023-03-19 13:51:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 13:51:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-19 13:51:10] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
[2023-03-19 13:51:10] [INFO ] Invariant cache hit.
[2023-03-19 13:51:10] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-19 13:51:10] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-19 13:51:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:10] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
[2023-03-19 13:51:10] [INFO ] Invariant cache hit.
[2023-03-19 13:51:10] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/93 places, 65/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 54/93 places, 65/100 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s3)], 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 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-05 finished in 247 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(p0)))'
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 85 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 85 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 81 transition count 91
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 81 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 77 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 77 transition count 87
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 73 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 73 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 70 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 70 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 68 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 68 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 68 transition count 76
Applied a total of 49 rules in 12 ms. Remains 68 /93 variables (removed 25) and now considering 76/100 (removed 24) transitions.
[2023-03-19 13:51:10] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
// Phase 1: matrix 69 rows 68 cols
[2023-03-19 13:51:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 13:51:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 13:51:10] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2023-03-19 13:51:10] [INFO ] Invariant cache hit.
[2023-03-19 13:51:11] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-19 13:51:11] [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 13:51:11] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2023-03-19 13:51:11] [INFO ] Invariant cache hit.
[2023-03-19 13:51:11] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/93 places, 76/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 68/93 places, 76/100 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 140 edges and 68 vertex of which 62 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-07 finished in 536 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' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Graph (complete) has 201 edges and 93 vertex of which 87 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 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 78 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 78 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 73 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 73 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 69 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 69 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 65 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 63 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 42 place count 62 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 62 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 44 place count 62 transition count 74
Applied a total of 44 rules in 16 ms. Remains 62 /93 variables (removed 31) and now considering 74/100 (removed 26) transitions.
[2023-03-19 13:51:11] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
// Phase 1: matrix 65 rows 62 cols
[2023-03-19 13:51:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 13:51:11] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 13:51:11] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2023-03-19 13:51:11] [INFO ] Invariant cache hit.
[2023-03-19 13:51:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-19 13:51:11] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-19 13:51:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:11] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2023-03-19 13:51:11] [INFO ] Invariant cache hit.
[2023-03-19 13:51:11] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/93 places, 74/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 62/93 places, 74/100 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s7 s52), p1:(LEQ s50 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-08 finished in 344 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(p1)||p0) U p2))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 85 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 85 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 81 transition count 91
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 81 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 77 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 77 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 74 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 74 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 72 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 72 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 70 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 70 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 70 transition count 78
Applied a total of 45 rules in 10 ms. Remains 70 /93 variables (removed 23) and now considering 78/100 (removed 22) transitions.
[2023-03-19 13:51:11] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
// Phase 1: matrix 71 rows 70 cols
[2023-03-19 13:51:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 13:51:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 13:51:11] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2023-03-19 13:51:11] [INFO ] Invariant cache hit.
[2023-03-19 13:51:11] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-19 13:51:11] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-19 13:51:11] [INFO ] Flow matrix only has 71 transitions (discarded 7 similar events)
[2023-03-19 13:51:11] [INFO ] Invariant cache hit.
[2023-03-19 13:51:12] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/93 places, 78/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 70/93 places, 78/100 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(LEQ 2 s66), p0:(OR (LEQ s41 s15) (LEQ 2 s4) (LEQ 3 s31)), p1:(LEQ 3 s31)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-09 finished in 455 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' '!(G((F(p0)&&X(X((p1||F(p2)))))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 86 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 86 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 83 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 83 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 81 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 81 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 79 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 79 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 77 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 77 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 75 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 75 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 75 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 74 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 74 transition count 83
Applied a total of 36 rules in 10 ms. Remains 74 /93 variables (removed 19) and now considering 83/100 (removed 17) transitions.
[2023-03-19 13:51:12] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 74 cols
[2023-03-19 13:51:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 13:51:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 13:51:12] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-19 13:51:12] [INFO ] Invariant cache hit.
[2023-03-19 13:51:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-19 13:51:12] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-19 13:51:12] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-19 13:51:12] [INFO ] Invariant cache hit.
[2023-03-19 13:51:12] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/93 places, 83/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 74/93 places, 83/100 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s45 s60), p1:(GT s12 s22), p2:(LEQ s8 s45)], 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 485 ms.
Stuttering criterion allowed to conclude after 16 steps with 3 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-10 finished in 899 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(G(p0))||F(p1))))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 85 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 85 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 81 transition count 91
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 81 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 77 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 77 transition count 87
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 73 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 73 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 70 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 70 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 67 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 67 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 67 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 66 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 66 transition count 74
Applied a total of 53 rules in 13 ms. Remains 66 /93 variables (removed 27) and now considering 74/100 (removed 26) transitions.
[2023-03-19 13:51:13] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 66 cols
[2023-03-19 13:51:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 13:51:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 13:51:13] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:13] [INFO ] Invariant cache hit.
[2023-03-19 13:51:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-19 13:51:13] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-19 13:51:13] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:13] [INFO ] Invariant cache hit.
[2023-03-19 13:51:13] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/93 places, 74/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 66/93 places, 74/100 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 1 s23), p0:(LEQ 2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 101 ms.
Stuttering criterion allowed to conclude after 171 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-11 finished in 666 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' '!((p0 U (p1&&X(G(!p0)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Graph (complete) has 201 edges and 93 vertex of which 87 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 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 79 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 79 transition count 92
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 75 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 75 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 21 place count 71 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 25 place count 71 transition count 84
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 28 place count 68 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 68 transition count 81
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 33 place count 66 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 36 place count 65 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 65 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 65 transition count 77
Applied a total of 38 rules in 16 ms. Remains 65 /93 variables (removed 28) and now considering 77/100 (removed 23) transitions.
[2023-03-19 13:51:13] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
// Phase 1: matrix 68 rows 65 cols
[2023-03-19 13:51:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 13:51:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-19 13:51:13] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-19 13:51:13] [INFO ] Invariant cache hit.
[2023-03-19 13:51:13] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-19 13:51:13] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-19 13:51:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:13] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2023-03-19 13:51:13] [INFO ] Invariant cache hit.
[2023-03-19 13:51:14] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/93 places, 77/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 65/93 places, 77/100 transitions.
Stuttering acceptance computed with spot in 132 ms :[p0, true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(LEQ s46 s5), p1:(LEQ s39 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-12 finished in 384 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' '!((G(p0)||(X(p1)&&F(p2))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 86 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 86 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 83 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 83 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 81 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 81 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 79 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 79 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 78 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 78 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 77 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 77 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 77 transition count 86
Applied a total of 30 rules in 9 ms. Remains 77 /93 variables (removed 16) and now considering 86/100 (removed 14) transitions.
[2023-03-19 13:51:14] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
// Phase 1: matrix 78 rows 77 cols
[2023-03-19 13:51:14] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 13:51:14] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 13:51:14] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-19 13:51:14] [INFO ] Invariant cache hit.
[2023-03-19 13:51:14] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 13:51:14] [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 13:51:14] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-19 13:51:14] [INFO ] Invariant cache hit.
[2023-03-19 13:51:14] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/93 places, 86/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 77/93 places, 86/100 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LEQ s51 0) (LEQ s15 s9)), p2:(LEQ 1 s70), p1:(GT s51 0)], 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]]
Product exploration explored 100000 steps with 1 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 159 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 159 edges and 77 vertex of which 71 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 526 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (AND p0 (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 12 factoid took 472 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 77 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-19 13:51:16] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-19 13:51:16] [INFO ] Invariant cache hit.
[2023-03-19 13:51:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 13:51:16] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-19 13:51:16] [INFO ] Invariant cache hit.
[2023-03-19 13:51:16] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 13:51:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-19 13:51:16] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-19 13:51:16] [INFO ] Invariant cache hit.
[2023-03-19 13:51:16] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 77/77 places, 86/86 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 159 edges and 77 vertex of which 71 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 3260 steps with 0 reset in 11 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-14 finished in 3393 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&&(G(p0)||G(F(p1))))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 100/100 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 89 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 83 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 83 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 79 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 79 transition count 89
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 75 transition count 85
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 75 transition count 85
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 72 transition count 82
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 72 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 69 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 69 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 66 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 66 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 66 transition count 74
Applied a total of 48 rules in 18 ms. Remains 66 /93 variables (removed 27) and now considering 74/100 (removed 26) transitions.
[2023-03-19 13:51:17] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 66 cols
[2023-03-19 13:51:17] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 13:51:17] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-19 13:51:17] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:17] [INFO ] Invariant cache hit.
[2023-03-19 13:51:17] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-19 13:51:17] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-19 13:51:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 13:51:17] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:17] [INFO ] Invariant cache hit.
[2023-03-19 13:51:17] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/93 places, 74/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 66/93 places, 74/100 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s51 s41), p1:(LEQ s36 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 208 ms.
Product exploration explored 100000 steps with 0 reset in 416 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 138 edges and 66 vertex of which 61 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 572 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4557 steps, including 1 resets, run visited all 2 properties in 51 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 324 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2023-03-19 13:51:19] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:19] [INFO ] Invariant cache hit.
[2023-03-19 13:51:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 13:51:19] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:19] [INFO ] Invariant cache hit.
[2023-03-19 13:51:20] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-19 13:51:20] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-19 13:51:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:20] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:20] [INFO ] Invariant cache hit.
[2023-03-19 13:51:20] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 66/66 places, 74/74 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 138 edges and 66 vertex of which 61 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Finished Best-First random walk after 79 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 433 ms.
Product exploration explored 100000 steps with 0 reset in 585 ms.
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2023-03-19 13:51:22] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:22] [INFO ] Invariant cache hit.
[2023-03-19 13:51:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 13:51:22] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:22] [INFO ] Invariant cache hit.
[2023-03-19 13:51:22] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-19 13:51:22] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-19 13:51:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 13:51:22] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
[2023-03-19 13:51:22] [INFO ] Invariant cache hit.
[2023-03-19 13:51:22] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 66/66 places, 74/74 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLCardinality-15 finished in 5020 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)))'
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(p1))) U ((X((p0||X(p1)))&&(G(!p0)||G(p2)))||X(G((p0||X(p1)))))))'
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&&(G(p0)||G(F(p1))))))'
[2023-03-19 13:51:23] [INFO ] Flatten gal took : 8 ms
[2023-03-19 13:51:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 13:51:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 93 places, 100 transitions and 308 arcs took 2 ms.
Total runtime 41947 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2306/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2306/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2306/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SemanticWebServices-PT-S064P18-LTLCardinality-00
Could not compute solution for formula : SemanticWebServices-PT-S064P18-LTLCardinality-03
Could not compute solution for formula : SemanticWebServices-PT-S064P18-LTLCardinality-15
BK_STOP 1679233884622
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name SemanticWebServices-PT-S064P18-LTLCardinality-00
ltl formula formula --ltl=/tmp/2306/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
pnml2lts-mc( 0/ 4): Petri net has 93 places, 100 transitions and 308 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2306/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2306/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2306/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2306/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name SemanticWebServices-PT-S064P18-LTLCardinality-03
ltl formula formula --ltl=/tmp/2306/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
pnml2lts-mc( 0/ 4): Petri net has 93 places, 100 transitions and 308 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2306/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2306/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2306/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2306/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 22 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-S064P18-LTLCardinality-15
ltl formula formula --ltl=/tmp/2306/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
pnml2lts-mc( 0/ 4): Petri net has 93 places, 100 transitions and 308 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2306/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2306/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2306/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2306/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
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-S064P18"
export BK_EXAMINATION="LTLCardinality"
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-S064P18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r361-smll-167891811400371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S064P18.tgz
mv SemanticWebServices-PT-S064P18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;