Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r524-tall-171679080500499.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SemanticWebServices-PT-S064P09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080500499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 102K May 18 16:43 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-S064P09-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717228336102

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-S064P09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:52:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:52:17] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 07:52:17] [INFO ] Transformed 100 places.
[2024-06-01 07:52:17] [INFO ] Transformed 164 transitions.
[2024-06-01 07:52:17] [INFO ] Parsed PT model containing 100 places and 164 transitions and 719 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 82/82 transitions.
Ensure Unique test removed 18 places
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 61 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 57 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 57 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 57 transition count 64
Applied a total of 59 rules in 21 ms. Remains 57 /98 variables (removed 41) and now considering 64/82 (removed 18) transitions.
[2024-06-01 07:52:17] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 57 cols
[2024-06-01 07:52:17] [INFO ] Computed 4 invariants in 8 ms
[2024-06-01 07:52:17] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 07:52:17] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-06-01 07:52:17] [INFO ] Invariant cache hit.
[2024-06-01 07:52:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 07:52:17] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 49 sub problems to find dead transitions.
[2024-06-01 07:52:17] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-06-01 07:52:17] [INFO ] Invariant cache hit.
[2024-06-01 07:52:17] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 44/89 variables, 45/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 35/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 12/101 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 11/112 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/112 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 96 constraints, problems are : Problem set: 0 solved, 49 unsolved in 918 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 44/89 variables, 45/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 35/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 12/101 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 11/112 variables, 11/144 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 145 constraints, problems are : Problem set: 0 solved, 49 unsolved in 748 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1692ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1701ms
Starting structural reductions in LTL mode, iteration 1 : 57/98 places, 64/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1980 ms. Remains : 57/98 places, 64/82 transitions.
Support contains 41 out of 57 places after structural reductions.
[2024-06-01 07:52:19] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:52:19] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:52:19] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40000 steps (8 resets) in 1851 ms. (21 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/2 properties
[2024-06-01 07:52:20] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-06-01 07:52:20] [INFO ] Invariant cache hit.
[2024-06-01 07:52:20] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 24/112 variables, and 14 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Generalized P Invariants (flows): 2/4 constraints, State Equation: 12/57 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 37 transition count 51
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 19 place count 28 transition count 42
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 28 transition count 42
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 19 transition count 33
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 19 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 14 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 14 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 14 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 12 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 10 transition count 15
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 74 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 75 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 76 place count 9 transition count 12
Applied a total of 76 rules in 21 ms. Remains 9 /57 variables (removed 48) and now considering 12/64 (removed 52) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-06-01 07:52:21] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:52:21] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:52:21] [INFO ] Invariant cache hit.
[2024-06-01 07:52:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:52:21] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 07:52:21] [INFO ] Redundant transitions in 13 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 07:52:21] [INFO ] Invariant cache hit.
[2024-06-01 07:52:21] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/21 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[State Equation: 7/9 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/18 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[State Equation: 8/9 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/57 places, 12/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 9/57 places, 12/64 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-03
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-03 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G((p1 U p2))))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 43 transition count 54
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 36 transition count 47
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 36 transition count 47
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 30 transition count 41
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 30 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 30 transition count 39
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 27 transition count 36
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 27 transition count 36
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 27 transition count 33
Applied a total of 61 rules in 3 ms. Remains 27 /57 variables (removed 30) and now considering 33/64 (removed 31) transitions.
[2024-06-01 07:52:21] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 27 cols
[2024-06-01 07:52:21] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:52:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 07:52:21] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-06-01 07:52:21] [INFO ] Invariant cache hit.
[2024-06-01 07:52:21] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 07:52:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-06-01 07:52:21] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-06-01 07:52:21] [INFO ] Invariant cache hit.
[2024-06-01 07:52:21] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/55 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/56 variables, and 47 constraints, problems are : Problem set: 0 solved, 28 unsolved in 459 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/56 variables, and 75 constraints, problems are : Problem set: 0 solved, 28 unsolved in 195 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 662ms
Starting structural reductions in LTL mode, iteration 1 : 27/57 places, 33/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 27/57 places, 33/64 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 263 ms.
Product exploration explored 100000 steps with 0 reset in 157 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/27 stabilizing places and 9/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 319 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9 resets) in 381 ms. (104 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
[2024-06-01 07:52:23] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-06-01 07:52:23] [INFO ] Invariant cache hit.
[2024-06-01 07:52:23] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/29 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/31 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 29 constraints, problems are : Problem set: 2 solved, 0 unsolved in 95 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 15/27 constraints, ReadFeed: 13/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p1) p0)), (G (OR p2 (NOT p1) (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 682 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-06-01 07:52:24] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-06-01 07:52:24] [INFO ] Invariant cache hit.
[2024-06-01 07:52:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:52:24] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-06-01 07:52:24] [INFO ] Invariant cache hit.
[2024-06-01 07:52:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 07:52:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-06-01 07:52:24] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-06-01 07:52:24] [INFO ] Invariant cache hit.
[2024-06-01 07:52:24] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/55 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/56 variables, and 47 constraints, problems are : Problem set: 0 solved, 28 unsolved in 225 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/56 variables, and 75 constraints, problems are : Problem set: 0 solved, 28 unsolved in 221 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 454ms
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 27/27 places, 33/33 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/27 stabilizing places and 9/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 13347 steps (4 resets) in 70 ms. (187 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Product exploration explored 100000 steps with 0 reset in 73 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 33/33 transitions.
Graph (complete) has 55 edges and 27 vertex of which 21 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 (Output transitions of discarded places.) removed 3 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 19 transition count 28
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 19 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 18 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 18 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 18 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 33 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 16 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 15 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 15 transition count 22
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 13 transition count 20
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 13 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 12 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 25 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 11 transition count 14
Applied a total of 26 rules in 12 ms. Remains 11 /27 variables (removed 16) and now considering 14/33 (removed 19) transitions.
[2024-06-01 07:52:26] [INFO ] Redundant transitions in 13 ms returned []
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-06-01 07:52:26] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:52:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/22 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/23 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 88 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3/22 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/24 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/27 places, 14/33 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 11/27 places, 14/33 transitions.
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 33/33 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 26 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 25 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 25 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 25 transition count 30
Applied a total of 5 rules in 1 ms. Remains 25 /27 variables (removed 2) and now considering 30/33 (removed 3) transitions.
[2024-06-01 07:52:26] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-06-01 07:52:26] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:52:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 07:52:26] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
[2024-06-01 07:52:26] [INFO ] Invariant cache hit.
[2024-06-01 07:52:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 07:52:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 25 sub problems to find dead transitions.
[2024-06-01 07:52:26] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
[2024-06-01 07:52:26] [INFO ] Invariant cache hit.
[2024-06-01 07:52:26] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/52 variables, and 43 constraints, problems are : Problem set: 0 solved, 25 unsolved in 201 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/52 variables, and 68 constraints, problems are : Problem set: 0 solved, 25 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 381ms
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 30/33 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 25/27 places, 30/33 transitions.
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-04 finished in 5968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p1 U p2))))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 47 transition count 58
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 39 transition count 50
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 39 transition count 50
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 32 transition count 43
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 32 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 32 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 29 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 29 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 29 transition count 34
Applied a total of 58 rules in 3 ms. Remains 29 /57 variables (removed 28) and now considering 34/64 (removed 30) transitions.
[2024-06-01 07:52:27] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 29 cols
[2024-06-01 07:52:27] [INFO ] Computed 1 invariants in 5 ms
[2024-06-01 07:52:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 07:52:27] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-06-01 07:52:27] [INFO ] Invariant cache hit.
[2024-06-01 07:52:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 07:52:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 25 sub problems to find dead transitions.
[2024-06-01 07:52:27] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-06-01 07:52:27] [INFO ] Invariant cache hit.
[2024-06-01 07:52:27] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/57 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 3/60 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 310 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 6/57 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 3/60 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 72 constraints, problems are : Problem set: 0 solved, 25 unsolved in 302 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 618ms
Starting structural reductions in LTL mode, iteration 1 : 29/57 places, 34/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 694 ms. Remains : 29/57 places, 34/64 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-08
Product exploration explored 100000 steps with 3 reset in 154 ms.
Product exploration explored 100000 steps with 4 reset in 158 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 330 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
RANDOM walk for 10037 steps (2 resets) in 28 ms. (346 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 1 factoid took 544 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
[2024-06-01 07:52:29] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-06-01 07:52:29] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 p1 p2))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 452 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-08 finished in 2891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 37 transition count 51
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 30 transition count 44
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 30 transition count 44
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 24 transition count 38
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 24 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 24 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 21 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 21 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 21 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 21 transition count 29
Graph (complete) has 44 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 20 transition count 28
Applied a total of 50 rules in 16 ms. Remains 20 /57 variables (removed 37) and now considering 28/64 (removed 36) transitions.
[2024-06-01 07:52:30] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 20 cols
[2024-06-01 07:52:30] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:52:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:52:30] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-06-01 07:52:30] [INFO ] Invariant cache hit.
[2024-06-01 07:52:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-01 07:52:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 07:52:30] [INFO ] Redundant transitions in 14 ms returned []
Running 17 sub problems to find dead transitions.
[2024-06-01 07:52:30] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-06-01 07:52:30] [INFO ] Invariant cache hit.
[2024-06-01 07:52:30] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/41 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/44 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 122 ms.
Refiners :[State Equation: 19/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 49 constraints, problems are : Problem set: 0 solved, 17 unsolved in 159 ms.
Refiners :[State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/57 places, 28/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 20/57 places, 28/64 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-09 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 41 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 38 transition count 51
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 18 place count 30 transition count 43
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 30 transition count 43
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 22 transition count 35
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 22 transition count 35
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 22 transition count 32
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 18 transition count 28
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 18 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 18 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 18 transition count 21
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 40 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 14 transition count 19
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 13 transition count 18
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 70 place count 12 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 72 place count 12 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 75 place count 10 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 76 place count 10 transition count 12
Applied a total of 76 rules in 14 ms. Remains 10 /57 variables (removed 47) and now considering 12/64 (removed 52) transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-06-01 07:52:30] [INFO ] Computed 0 invariants in 3 ms
[2024-06-01 07:52:30] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 07:52:30] [INFO ] Invariant cache hit.
[2024-06-01 07:52:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:52:30] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 07:52:30] [INFO ] Redundant transitions in 10 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 07:52:30] [INFO ] Invariant cache hit.
[2024-06-01 07:52:30] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[State Equation: 9/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/57 places, 12/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 10/57 places, 12/64 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 07:52:31] [INFO ] Invariant cache hit.
[2024-06-01 07:52:31] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:52:31] [INFO ] Invariant cache hit.
[2024-06-01 07:52:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:52:31] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 07:52:31] [INFO ] Redundant transitions in 12 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 07:52:31] [INFO ] Invariant cache hit.
[2024-06-01 07:52:31] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[State Equation: 9/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 10/10 places, 12/12 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 60 ms.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 07:52:32] [INFO ] Invariant cache hit.
[2024-06-01 07:52:32] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:52:32] [INFO ] Invariant cache hit.
[2024-06-01 07:52:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:52:32] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 07:52:32] [INFO ] Redundant transitions in 9 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 07:52:32] [INFO ] Invariant cache hit.
[2024-06-01 07:52:32] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46 ms.
Refiners :[State Equation: 9/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 10/10 places, 12/12 transitions.
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-10 finished in 2083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(X(p0)) U ((!p0 U p1) U p2))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 44 transition count 55
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 36 transition count 47
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 36 transition count 47
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 28 transition count 39
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 28 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 28 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 26 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 26 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 26 transition count 32
Applied a total of 63 rules in 2 ms. Remains 26 /57 variables (removed 31) and now considering 32/64 (removed 32) transitions.
[2024-06-01 07:52:32] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2024-06-01 07:52:32] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:52:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 07:52:32] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-06-01 07:52:32] [INFO ] Invariant cache hit.
[2024-06-01 07:52:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 07:52:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-06-01 07:52:32] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-06-01 07:52:32] [INFO ] Invariant cache hit.
[2024-06-01 07:52:32] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/54 variables, and 43 constraints, problems are : Problem set: 0 solved, 26 unsolved in 222 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/54 variables, and 69 constraints, problems are : Problem set: 0 solved, 26 unsolved in 179 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 407ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 408ms
Starting structural reductions in LTL mode, iteration 1 : 26/57 places, 32/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 26/57 places, 32/64 transitions.
Stuttering acceptance computed with spot in 225 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 238 ms.
Product exploration explored 100000 steps with 3 reset in 214 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 660 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
RANDOM walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/10 properties
BEST_FIRST walk for 210 steps (0 resets) in 4 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 723 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 260 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 07:52:36] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-06-01 07:52:36] [INFO ] Invariant cache hit.
[2024-06-01 07:52:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:52:36] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-06-01 07:52:36] [INFO ] Invariant cache hit.
[2024-06-01 07:52:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 07:52:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-06-01 07:52:36] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-06-01 07:52:36] [INFO ] Invariant cache hit.
[2024-06-01 07:52:36] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/54 variables, and 43 constraints, problems are : Problem set: 0 solved, 26 unsolved in 199 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/54 variables, and 69 constraints, problems are : Problem set: 0 solved, 26 unsolved in 182 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 389ms
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 26/26 places, 32/32 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 482 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
RANDOM walk for 40001 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/10 properties
BEST_FIRST walk for 192 steps (0 resets) in 4 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 723 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 263 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 241 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 1 reset in 151 ms.
Applying partial POR strategy [false, true, false, false, false, true]
Stuttering acceptance computed with spot in 228 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 32/32 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 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 10 ms. Remains 26 /26 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 07:52:39] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 07:52:39] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2024-06-01 07:52:39] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:52:39] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem TDEAD0 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/54 variables, and 43 constraints, problems are : Problem set: 1 solved, 25 unsolved in 207 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 2/24 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/50 variables, 24/25 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 17/42 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 25/67 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/51 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/54 variables, and 68 constraints, problems are : Problem set: 1 solved, 25 unsolved in 215 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 431ms problems are : Problem set: 1 solved, 25 unsolved
Search for dead transitions found 1 dead transitions in 432ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 31/32 transitions.
Graph (complete) has 50 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 31/31 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/26 places, 31/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 452 ms. Remains : 25/26 places, 31/32 transitions.
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 07:52:39] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2024-06-01 07:52:39] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:52:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:52:39] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-06-01 07:52:39] [INFO ] Invariant cache hit.
[2024-06-01 07:52:39] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 07:52:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-06-01 07:52:39] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-06-01 07:52:39] [INFO ] Invariant cache hit.
[2024-06-01 07:52:39] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/54 variables, and 43 constraints, problems are : Problem set: 0 solved, 26 unsolved in 197 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/54 variables, and 69 constraints, problems are : Problem set: 0 solved, 26 unsolved in 169 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 371ms
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 26/26 places, 32/32 transitions.
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-11 finished in 7523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p1))))))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 45 transition count 56
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 37 transition count 48
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 37 transition count 48
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 29 transition count 40
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 29 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 29 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 25 transition count 33
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 25 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 25 transition count 29
Applied a total of 67 rules in 2 ms. Remains 25 /57 variables (removed 32) and now considering 29/64 (removed 35) transitions.
[2024-06-01 07:52:40] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-06-01 07:52:40] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:52:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 07:52:40] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2024-06-01 07:52:40] [INFO ] Invariant cache hit.
[2024-06-01 07:52:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 07:52:40] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-06-01 07:52:40] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2024-06-01 07:52:40] [INFO ] Invariant cache hit.
[2024-06-01 07:52:40] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/52 variables, and 39 constraints, problems are : Problem set: 0 solved, 22 unsolved in 170 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/52 variables, and 61 constraints, problems are : Problem set: 0 solved, 22 unsolved in 132 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 321ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 321ms
Starting structural reductions in LTL mode, iteration 1 : 25/57 places, 29/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 25/57 places, 29/64 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-12 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 37 transition count 52
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 17 place count 29 transition count 44
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 29 transition count 44
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 22 transition count 37
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 22 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 22 transition count 34
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 19 transition count 31
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 19 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 19 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 33 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 17 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 16 transition count 22
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 15 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 15 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 15 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 64 place count 14 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 65 place count 14 transition count 18
Applied a total of 65 rules in 10 ms. Remains 14 /57 variables (removed 43) and now considering 18/64 (removed 46) transitions.
Normalized transition count is 17 out of 18 initially.
// Phase 1: matrix 17 rows 14 cols
[2024-06-01 07:52:40] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:52:40] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 07:52:40] [INFO ] Invariant cache hit.
[2024-06-01 07:52:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:52:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 07:52:40] [INFO ] Redundant transitions in 14 ms returned [4]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 14 cols
[2024-06-01 07:52:40] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 07:52:40] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/26 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/31 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 77 ms.
Refiners :[State Equation: 12/14 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/24 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/26 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/27 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/31 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 83 ms.
Refiners :[State Equation: 13/14 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/57 places, 17/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 14/57 places, 17/64 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 42 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 30024 steps (7 resets) in 61 ms. (484 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 323 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 8 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-06-01 07:52:42] [INFO ] Invariant cache hit.
[2024-06-01 07:52:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 07:52:42] [INFO ] Invariant cache hit.
[2024-06-01 07:52:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:52:42] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 07:52:42] [INFO ] Redundant transitions in 14 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 07:52:42] [INFO ] Invariant cache hit.
[2024-06-01 07:52:42] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/26 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/31 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 84 ms.
Refiners :[State Equation: 12/14 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/24 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/26 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/27 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/31 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 89 ms.
Refiners :[State Equation: 13/14 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 189ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 14/14 places, 17/17 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 36679 steps (8 resets) in 57 ms. (632 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-13 finished in 2484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p0&&X(p0)&&F(p1))||X(G(p0)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 43 transition count 54
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 37 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 37 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 31 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 31 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 30 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 30 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 30 transition count 37
Applied a total of 54 rules in 7 ms. Remains 30 /57 variables (removed 27) and now considering 37/64 (removed 27) transitions.
[2024-06-01 07:52:43] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 30 cols
[2024-06-01 07:52:43] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:52:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 07:52:43] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-06-01 07:52:43] [INFO ] Invariant cache hit.
[2024-06-01 07:52:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 07:52:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 07:52:43] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-06-01 07:52:43] [INFO ] Invariant cache hit.
[2024-06-01 07:52:43] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 31/61 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/62 variables, and 53 constraints, problems are : Problem set: 0 solved, 32 unsolved in 265 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 31/61 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 32/85 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/62 variables, and 85 constraints, problems are : Problem set: 0 solved, 32 unsolved in 201 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 472ms
Starting structural reductions in LTL mode, iteration 1 : 30/57 places, 37/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 30/57 places, 37/64 transitions.
Stuttering acceptance computed with spot in 359 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-14
Stuttering criterion allowed to conclude after 6553 steps with 2230 reset in 11 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-14 finished in 926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(!p0)))&&((p1 U p2) U (p3||F(p4)))))'
Support contains 9 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 42 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 40 transition count 54
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 33 transition count 47
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 33 transition count 47
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 27 transition count 41
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 27 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 27 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 23 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 23 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 23 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 37 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 21 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 20 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 58 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 19 transition count 22
Applied a total of 60 rules in 5 ms. Remains 19 /57 variables (removed 38) and now considering 22/64 (removed 42) transitions.
// Phase 1: matrix 22 rows 19 cols
[2024-06-01 07:52:44] [INFO ] Computed 0 invariants in 2 ms
[2024-06-01 07:52:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 07:52:44] [INFO ] Invariant cache hit.
[2024-06-01 07:52:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:52:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 07:52:44] [INFO ] Redundant transitions in 14 ms returned []
Running 14 sub problems to find dead transitions.
[2024-06-01 07:52:44] [INFO ] Invariant cache hit.
[2024-06-01 07:52:44] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 4/30 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 4/34 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/41 variables, and 29 constraints, problems are : Problem set: 0 solved, 14 unsolved in 135 ms.
Refiners :[State Equation: 16/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/26 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 4/30 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 4/34 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/34 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/41 variables, and 43 constraints, problems are : Problem set: 0 solved, 14 unsolved in 107 ms.
Refiners :[State Equation: 16/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 245ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/57 places, 22/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 19/57 places, 22/64 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR p0 (AND (NOT p3) (NOT p4))), p0, (NOT p4), (AND (NOT p2) (NOT p4)), (AND (NOT p3) (NOT p4)), p0, true]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-15 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G((p1 U p2))))))'
Found a Lengthening insensitive property : SemanticWebServices-PT-S064P09-LTLCardinality-04
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 39 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 37 transition count 51
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 29 transition count 43
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 29 transition count 43
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 22 transition count 36
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 22 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 22 transition count 34
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 18 transition count 30
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 18 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 18 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 33 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 16 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 64 place count 14 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 14 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 14 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 67 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 68 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 69 place count 13 transition count 16
Applied a total of 69 rules in 15 ms. Remains 13 /57 variables (removed 44) and now considering 16/64 (removed 48) transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-06-01 07:52:45] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 07:52:45] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:52:45] [INFO ] Invariant cache hit.
[2024-06-01 07:52:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 07:52:45] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-06-01 07:52:45] [INFO ] Invariant cache hit.
[2024-06-01 07:52:45] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2/28 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/29 variables, and 23 constraints, problems are : Problem set: 0 solved, 11 unsolved in 106 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3/24 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/28 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 34 constraints, problems are : Problem set: 0 solved, 11 unsolved in 92 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 216ms
Starting structural reductions in LI_LTL mode, iteration 1 : 13/57 places, 16/64 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 273 ms. Remains : 13/57 places, 16/64 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 49 ms.
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-04 finished in 624 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(X(p0)) U ((!p0 U p1) U p2))))'
Found a Shortening insensitive property : SemanticWebServices-PT-S064P09-LTLCardinality-11
Stuttering acceptance computed with spot in 220 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 46 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 43 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 43 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 42 transition count 53
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 34 transition count 45
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 34 transition count 45
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 26 transition count 37
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 26 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 26 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 24 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 24 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 24 transition count 30
Applied a total of 53 rules in 12 ms. Remains 24 /57 variables (removed 33) and now considering 30/64 (removed 34) transitions.
[2024-06-01 07:52:45] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 24 cols
[2024-06-01 07:52:45] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:52:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:52:45] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 07:52:45] [INFO ] Invariant cache hit.
[2024-06-01 07:52:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 07:52:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2024-06-01 07:52:46] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 07:52:46] [INFO ] Invariant cache hit.
[2024-06-01 07:52:46] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 134 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/50 variables, and 53 constraints, problems are : Problem set: 0 solved, 18 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 260ms
Starting structural reductions in LI_LTL mode, iteration 1 : 24/57 places, 30/64 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 346 ms. Remains : 24/57 places, 30/64 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-11
Product exploration explored 100000 steps with 1 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 733 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
RANDOM walk for 40002 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/10 properties
BEST_FIRST walk for 33387 steps (7 resets) in 15 ms. (2086 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 1020 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 459 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 07:52:49] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 07:52:49] [INFO ] Invariant cache hit.
[2024-06-01 07:52:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 07:52:49] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 07:52:49] [INFO ] Invariant cache hit.
[2024-06-01 07:52:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 07:52:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2024-06-01 07:52:49] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-06-01 07:52:49] [INFO ] Invariant cache hit.
[2024-06-01 07:52:49] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/50 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/50 variables, and 53 constraints, problems are : Problem set: 0 solved, 18 unsolved in 122 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 271ms
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 24/24 places, 30/30 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 788 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
RANDOM walk for 33336 steps (7 resets) in 85 ms. (387 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 1097 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 225 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 242 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 0 reset in 116 ms.
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-11 finished in 7151 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 07:52:52] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:52:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 07:52:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 64 transitions and 232 arcs took 4 ms.
Total runtime 35465 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : SemanticWebServices-PT-S064P09-LTLCardinality-04
Could not compute solution for formula : SemanticWebServices-PT-S064P09-LTLCardinality-10
Could not compute solution for formula : SemanticWebServices-PT-S064P09-LTLCardinality-11

BK_STOP 1717228383880

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name SemanticWebServices-PT-S064P09-LTLCardinality-04
ltl formula formula --ltl=/tmp/2479/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 57 places, 64 transitions and 232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2479/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2479/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2479/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2479/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 46 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 58, there are 80 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~150004 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~300004 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~600004 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~1200004 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~2400004 transitions
pnml2lts-mc( 2/ 4): ~40000 levels ~320000 states ~2400004 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 261338
pnml2lts-mc( 0/ 4): unique transitions count: 3920070
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 261341
pnml2lts-mc( 0/ 4): - cum. max stack depth: 261341
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 261341 states 3920096 transitions, fanout: 15.000
pnml2lts-mc( 0/ 4): Total exploration time 3.360 sec (3.250 sec minimum, 3.315 sec on average)
pnml2lts-mc( 0/ 4): States per second: 77780, Transitions per second: 1166695
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 93.9MB, 25.1 B/state, compr.: 10.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 64 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 93.9MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S064P09-LTLCardinality-10
ltl formula formula --ltl=/tmp/2479/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 57 places, 64 transitions and 232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2479/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2479/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2479/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2479/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 47 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 58, there are 67 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~150064 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~300064 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~480064 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~960064 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~1920064 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~3840064 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 253582
pnml2lts-mc( 0/ 4): unique transitions count: 3723461
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 253585
pnml2lts-mc( 0/ 4): - cum. max stack depth: 253585
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 253585 states 3723504 transitions, fanout: 14.683
pnml2lts-mc( 0/ 4): Total exploration time 3.050 sec (3.020 sec minimum, 3.038 sec on average)
pnml2lts-mc( 0/ 4): States per second: 83143, Transitions per second: 1220821
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 92.4MB, 26.0 B/state, compr.: 11.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 64 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 92.4MB (~256.0MB paged-in)
ltl formula name SemanticWebServices-PT-S064P09-LTLCardinality-11
ltl formula formula --ltl=/tmp/2479/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 57 places, 64 transitions and 232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2479/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2479/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2479/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2479/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 46 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 58, there are 93 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~150064 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~300064 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~600064 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~1200064 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~2400064 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~4800064 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 271407
pnml2lts-mc( 0/ 4): unique transitions count: 4481663
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 271410
pnml2lts-mc( 0/ 4): - cum. max stack depth: 271410
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 271410 states 4481728 transitions, fanout: 16.513
pnml2lts-mc( 0/ 4): Total exploration time 3.440 sec (3.220 sec minimum, 3.327 sec on average)
pnml2lts-mc( 0/ 4): States per second: 78898, Transitions per second: 1302828
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 98.2MB, 23.0 B/state, compr.: 9.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 64 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 98.2MB (~256.0MB paged-in)

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-S064P09"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is SemanticWebServices-PT-S064P09, 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 r524-tall-171679080500499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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