fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r334-tall-171679080600563
Last Updated
July 7, 2024

About the Execution of ITS-Tools for SemanticWebServices-PT-S128P18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
357.004 21791.00 39394.00 146.90 FFFFFTTTFTTFFFFF normal

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.r334-tall-171679080600563.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 itstools
Input is SemanticWebServices-PT-S128P18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080600563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 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 261K 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-S128P18-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S128P18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716853240223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-27 23:40:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 23:40:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:40:41] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-27 23:40:41] [INFO ] Transformed 184 places.
[2024-05-27 23:40:41] [INFO ] Transformed 466 transitions.
[2024-05-27 23:40:41] [INFO ] Parsed PT model containing 184 places and 466 transitions and 1873 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 269 transitions
Reduce redundant transitions removed 269 transitions.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 195/195 transitions.
Ensure Unique test removed 48 places
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 109 transition count 124
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 150 place count 103 transition count 118
Iterating global reduction 1 with 6 rules applied. Total rules applied 156 place count 103 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 157 place count 103 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 102 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 102 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 101 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 101 transition count 115
Applied a total of 161 rules in 34 ms. Remains 101 /182 variables (removed 81) and now considering 115/195 (removed 80) transitions.
[2024-05-27 23:40:41] [INFO ] Flow matrix only has 106 transitions (discarded 9 similar events)
// Phase 1: matrix 106 rows 101 cols
[2024-05-27 23:40:41] [INFO ] Computed 2 invariants in 7 ms
[2024-05-27 23:40:41] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-27 23:40:41] [INFO ] Flow matrix only has 106 transitions (discarded 9 similar events)
[2024-05-27 23:40:41] [INFO ] Invariant cache hit.
[2024-05-27 23:40:42] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-27 23:40:42] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-05-27 23:40:42] [INFO ] Flow matrix only has 106 transitions (discarded 9 similar events)
[2024-05-27 23:40:42] [INFO ] Invariant cache hit.
[2024-05-27 23:40:42] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 2/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 94/188 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 85/181 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/207 variables, and 181 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1633 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/101 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 2/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 94/188 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 85/181 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 99/280 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/207 variables, and 280 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1210 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 94/101 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 2886ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 2903ms
Starting structural reductions in LTL mode, iteration 1 : 101/182 places, 115/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3247 ms. Remains : 101/182 places, 115/195 transitions.
Support contains 37 out of 101 places after structural reductions.
[2024-05-27 23:40:45] [INFO ] Flatten gal took : 22 ms
[2024-05-27 23:40:45] [INFO ] Flatten gal took : 9 ms
[2024-05-27 23:40:45] [INFO ] Input system was already deterministic with 115 transitions.
RANDOM walk for 40000 steps (8 resets) in 1616 ms. (24 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
[2024-05-27 23:40:45] [INFO ] Flow matrix only has 106 transitions (discarded 9 similar events)
[2024-05-27 23:40:45] [INFO ] Invariant cache hit.
[2024-05-27 23:40:45] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 33/207 variables, and 16 constraints, problems are : Problem set: 3 solved, 0 unsolved in 30 ms.
Refiners :[Generalized P Invariants (flows): 1/2 constraints, State Equation: 15/101 constraints, ReadFeed: 0/85 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-11 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' '!(X(G((p0||(G(p1)&&(p2||(G(!p1) U !p0)))))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 115/115 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 93 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 86 transition count 97
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 86 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 80 transition count 90
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 80 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 77 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 77 transition count 87
Applied a total of 52 rules in 12 ms. Remains 77 /101 variables (removed 24) and now considering 87/115 (removed 28) transitions.
[2024-05-27 23:40:46] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
// Phase 1: matrix 78 rows 77 cols
[2024-05-27 23:40:46] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 23:40:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 23:40:46] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-05-27 23:40:46] [INFO ] Invariant cache hit.
[2024-05-27 23:40:46] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-27 23:40:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-27 23:40:46] [INFO ] Flow matrix only has 78 transitions (discarded 9 similar events)
[2024-05-27 23:40:46] [INFO ] Invariant cache hit.
[2024-05-27 23:40:46] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 2/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 77/154 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 69/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 147 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1229 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 2/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 77/154 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 69/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 83/230 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 230 constraints, problems are : Problem set: 0 solved, 83 unsolved in 884 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2125ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 2130ms
Starting structural reductions in LTL mode, iteration 1 : 77/101 places, 87/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2224 ms. Remains : 77/101 places, 87/115 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-02 finished in 2528 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)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 115/115 transitions.
Graph (complete) has 197 edges and 101 vertex of which 88 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 86 transition count 100
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 79 transition count 93
Iterating global reduction 1 with 7 rules applied. Total rules applied 26 place count 79 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 79 transition count 92
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 33 place count 73 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 73 transition count 86
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 68 transition count 81
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 68 transition count 81
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 63 transition count 76
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 63 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 59 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 59 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 57 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 57 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 56 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 56 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 56 transition count 67
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 115 edges and 55 vertex of which 54 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 2 with 2 rules applied. Total rules applied 77 place count 54 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 53 transition count 65
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 53 transition count 65
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 52 transition count 64
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 52 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 50 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 50 transition count 62
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 48 transition count 60
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 48 transition count 60
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 47 transition count 59
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 47 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 46 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 46 transition count 58
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 45 transition count 57
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 45 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 45 transition count 56
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 98 place count 45 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 44 transition count 54
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 100 place count 44 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 43 transition count 53
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 102 place count 42 transition count 52
Iterating global reduction 6 with 1 rules applied. Total rules applied 103 place count 42 transition count 52
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 105 place count 40 transition count 50
Iterating global reduction 6 with 2 rules applied. Total rules applied 107 place count 40 transition count 50
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 110 place count 37 transition count 47
Iterating global reduction 6 with 3 rules applied. Total rules applied 113 place count 37 transition count 47
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 117 place count 33 transition count 43
Iterating global reduction 6 with 4 rules applied. Total rules applied 121 place count 33 transition count 43
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 124 place count 30 transition count 40
Iterating global reduction 6 with 3 rules applied. Total rules applied 127 place count 30 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 130 place count 30 transition count 37
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 131 place count 30 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 132 place count 29 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 133 place count 29 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 134 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 135 place count 27 transition count 34
Iterating global reduction 9 with 1 rules applied. Total rules applied 136 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 138 place count 25 transition count 32
Iterating global reduction 9 with 2 rules applied. Total rules applied 140 place count 25 transition count 32
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 142 place count 23 transition count 30
Iterating global reduction 9 with 2 rules applied. Total rules applied 144 place count 23 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 146 place count 23 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 147 place count 23 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 148 place count 22 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 149 place count 22 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 150 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 151 place count 20 transition count 25
Iterating global reduction 12 with 1 rules applied. Total rules applied 152 place count 20 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 153 place count 20 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 155 place count 20 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 156 place count 19 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 157 place count 19 transition count 21
Applied a total of 157 rules in 55 ms. Remains 19 /101 variables (removed 82) and now considering 21/115 (removed 94) transitions.
// Phase 1: matrix 21 rows 19 cols
[2024-05-27 23:40:48] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 23:40:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-27 23:40:48] [INFO ] Invariant cache hit.
[2024-05-27 23:40:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-27 23:40:48] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-27 23:40:48] [INFO ] Redundant transitions in 16 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-27 23:40:48] [INFO ] Invariant cache hit.
[2024-05-27 23:40:48] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/33 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 14 unsolved in 164 ms.
Refiners :[State Equation: 17/19 constraints, ReadFeed: 14/14 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/31 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/35 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/36 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 1/37 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/40 variables, and 46 constraints, problems are : Problem set: 0 solved, 14 unsolved in 144 ms.
Refiners :[State Equation: 18/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/101 places, 21/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 19/101 places, 21/115 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 296 ms.
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-03 finished in 782 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&&X(X(G((X(p0)||(p1 U (G(p1)||(p1&&G(!p0)))))))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 115/115 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 93 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 87 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 87 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 87 transition count 97
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 82 transition count 92
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 82 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 79 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 79 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 77 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 77 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 75 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 75 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 74 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 74 transition count 84
Applied a total of 58 rules in 17 ms. Remains 74 /101 variables (removed 27) and now considering 84/115 (removed 31) transitions.
[2024-05-27 23:40:49] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
// Phase 1: matrix 75 rows 74 cols
[2024-05-27 23:40:49] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 23:40:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 23:40:49] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-27 23:40:49] [INFO ] Invariant cache hit.
[2024-05-27 23:40:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 23:40:49] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-27 23:40:49] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-27 23:40:49] [INFO ] Invariant cache hit.
[2024-05-27 23:40:49] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 2/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 74/148 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/148 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/149 variables, and 141 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1130 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 2/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 74/148 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 80/221 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/149 variables, and 221 constraints, problems are : Problem set: 0 solved, 80 unsolved in 830 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 1971ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 1972ms
Starting structural reductions in LTL mode, iteration 1 : 74/101 places, 84/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2079 ms. Remains : 74/101 places, 84/115 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-04 finished in 2434 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((G(p1)||p0))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 115/115 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 95 transition count 106
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 89 transition count 100
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 89 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 89 transition count 99
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 84 transition count 94
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 84 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 81 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 81 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 80 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 80 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 79 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 79 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 78 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 78 transition count 88
Applied a total of 50 rules in 12 ms. Remains 78 /101 variables (removed 23) and now considering 88/115 (removed 27) transitions.
[2024-05-27 23:40:51] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
// Phase 1: matrix 79 rows 78 cols
[2024-05-27 23:40:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 23:40:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 23:40:51] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-05-27 23:40:51] [INFO ] Invariant cache hit.
[2024-05-27 23:40:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 23:40:51] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-27 23:40:51] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-05-27 23:40:51] [INFO ] Invariant cache hit.
[2024-05-27 23:40:51] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 2/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 76/152 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 68/145 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/157 variables, and 145 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1195 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/78 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 2/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 76/152 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 68/145 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 82/227 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/157 variables, and 227 constraints, problems are : Problem set: 0 solved, 82 unsolved in 847 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/78 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 2049ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 2051ms
Starting structural reductions in LTL mode, iteration 1 : 78/101 places, 88/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2145 ms. Remains : 78/101 places, 88/115 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 202 ms.
Product exploration explored 100000 steps with 33333 reset in 166 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-05 finished in 2741 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)))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 115/115 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 94 transition count 105
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 88 transition count 99
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 88 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 88 transition count 98
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 35 place count 83 transition count 93
Iterating global reduction 2 with 5 rules applied. Total rules applied 40 place count 83 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 80 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 80 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 79 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 79 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 78 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 78 transition count 88
Applied a total of 50 rules in 5 ms. Remains 78 /101 variables (removed 23) and now considering 88/115 (removed 27) transitions.
[2024-05-27 23:40:54] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
// Phase 1: matrix 79 rows 78 cols
[2024-05-27 23:40:54] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 23:40:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 23:40:54] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-05-27 23:40:54] [INFO ] Invariant cache hit.
[2024-05-27 23:40:54] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-27 23:40:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-27 23:40:54] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-05-27 23:40:54] [INFO ] Invariant cache hit.
[2024-05-27 23:40:54] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 2/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 77/154 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 69/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/157 variables, and 147 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1129 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/78 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 2/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 77/154 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 69/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 83/230 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/157 variables, and 230 constraints, problems are : Problem set: 0 solved, 83 unsolved in 848 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/78 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 1984ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 1985ms
Starting structural reductions in LTL mode, iteration 1 : 78/101 places, 88/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2064 ms. Remains : 78/101 places, 88/115 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-10 finished in 2295 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(G((F(G(p0)) U p1)))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 115/115 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 93 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 87 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 87 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 87 transition count 97
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 82 transition count 92
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 82 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 79 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 79 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 78 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 78 transition count 88
Applied a total of 50 rules in 5 ms. Remains 78 /101 variables (removed 23) and now considering 88/115 (removed 27) transitions.
[2024-05-27 23:40:56] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
// Phase 1: matrix 79 rows 78 cols
[2024-05-27 23:40:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 23:40:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 23:40:56] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-05-27 23:40:56] [INFO ] Invariant cache hit.
[2024-05-27 23:40:56] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-27 23:40:56] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-27 23:40:56] [INFO ] Flow matrix only has 79 transitions (discarded 9 similar events)
[2024-05-27 23:40:56] [INFO ] Invariant cache hit.
[2024-05-27 23:40:56] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 2/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 78/156 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 70/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/157 variables, and 149 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1160 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 2/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 78/156 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 70/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 84/233 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/157 variables, and 233 constraints, problems are : Problem set: 0 solved, 84 unsolved in 866 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 2035ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 2036ms
Starting structural reductions in LTL mode, iteration 1 : 78/101 places, 88/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2130 ms. Remains : 78/101 places, 88/115 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-12
Stuttering criterion allowed to conclude after 258 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-12 finished in 2387 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(p0)||F((G(F(!p1))||(p2&&F(!p1))))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 115/115 transitions.
Graph (complete) has 197 edges and 101 vertex of which 89 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 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 87 transition count 101
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 79 transition count 93
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 79 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 79 transition count 92
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 72 transition count 85
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 72 transition count 85
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 66 transition count 79
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 66 transition count 79
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 61 transition count 74
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 61 transition count 74
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 57 transition count 70
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 57 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 55 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 55 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 54 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 54 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 53 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 53 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 53 transition count 65
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 83 place count 53 transition count 63
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 107 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 51 transition count 62
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 50 transition count 61
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 50 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 49 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 49 transition count 60
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 91 place count 47 transition count 58
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 47 transition count 58
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 45 transition count 56
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 45 transition count 56
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 44 transition count 55
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 44 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 43 transition count 54
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 43 transition count 54
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 42 transition count 53
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 42 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 42 transition count 52
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 105 place count 42 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 106 place count 41 transition count 51
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 107 place count 41 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 108 place count 40 transition count 50
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 109 place count 39 transition count 49
Iterating global reduction 7 with 1 rules applied. Total rules applied 110 place count 39 transition count 49
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 112 place count 37 transition count 47
Iterating global reduction 7 with 2 rules applied. Total rules applied 114 place count 37 transition count 47
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 117 place count 34 transition count 44
Iterating global reduction 7 with 3 rules applied. Total rules applied 120 place count 34 transition count 44
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 124 place count 30 transition count 40
Iterating global reduction 7 with 4 rules applied. Total rules applied 128 place count 30 transition count 40
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 131 place count 27 transition count 37
Iterating global reduction 7 with 3 rules applied. Total rules applied 134 place count 27 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 137 place count 27 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 138 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 139 place count 26 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 141 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 142 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 143 place count 24 transition count 30
Iterating global reduction 10 with 1 rules applied. Total rules applied 144 place count 24 transition count 30
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 146 place count 22 transition count 28
Iterating global reduction 10 with 2 rules applied. Total rules applied 148 place count 22 transition count 28
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 150 place count 20 transition count 26
Iterating global reduction 10 with 2 rules applied. Total rules applied 152 place count 20 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 154 place count 20 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 155 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 156 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 12 with 1 rules applied. Total rules applied 157 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 158 place count 18 transition count 22
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 159 place count 17 transition count 21
Iterating global reduction 13 with 1 rules applied. Total rules applied 160 place count 17 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 161 place count 17 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 162 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 163 place count 16 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 164 place count 16 transition count 18
Applied a total of 164 rules in 28 ms. Remains 16 /101 variables (removed 85) and now considering 18/115 (removed 97) transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-05-27 23:40:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 23:40:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-27 23:40:59] [INFO ] Invariant cache hit.
[2024-05-27 23:40:59] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-27 23:40:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-27 23:40:59] [INFO ] Redundant transitions in 12 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-27 23:40:59] [INFO ] Invariant cache hit.
[2024-05-27 23:40:59] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/25 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 2/27 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/34 variables, and 25 constraints, problems are : Problem set: 0 solved, 11 unsolved in 104 ms.
Refiners :[State Equation: 14/16 constraints, ReadFeed: 11/11 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/25 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/29 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/30 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/30 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/31 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/31 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/31 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/34 variables, and 37 constraints, problems are : Problem set: 0 solved, 11 unsolved in 119 ms.
Refiners :[State Equation: 15/16 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 226ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/101 places, 18/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 16/101 places, 18/115 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) p1), p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-13
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-13 finished in 495 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(((G(!p0)||(!p0&&F(p1))) U p2))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 115/115 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 93 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 86 transition count 97
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 86 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 86 transition count 96
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 80 transition count 90
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 80 transition count 90
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 76 transition count 86
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 76 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 74 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 74 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 72 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 71 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 71 transition count 81
Applied a total of 64 rules in 7 ms. Remains 71 /101 variables (removed 30) and now considering 81/115 (removed 34) transitions.
[2024-05-27 23:40:59] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
// Phase 1: matrix 72 rows 71 cols
[2024-05-27 23:40:59] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 23:40:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 23:40:59] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2024-05-27 23:40:59] [INFO ] Invariant cache hit.
[2024-05-27 23:40:59] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-27 23:40:59] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-27 23:40:59] [INFO ] Flow matrix only has 72 transitions (discarded 9 similar events)
[2024-05-27 23:40:59] [INFO ] Invariant cache hit.
[2024-05-27 23:40:59] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 2/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 71/142 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 63/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/142 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/143 variables, and 135 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1058 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 2/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 71/142 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 63/135 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 77/212 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/143 variables, and 212 constraints, problems are : Problem set: 0 solved, 77 unsolved in 761 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 1825ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 1826ms
Starting structural reductions in LTL mode, iteration 1 : 71/101 places, 81/115 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1912 ms. Remains : 71/101 places, 81/115 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P18-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P18-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P18-LTLCardinality-15 finished in 2184 ms.
All properties solved by simple procedures.
Total runtime 20606 ms.

BK_STOP 1716853262014

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S128P18, 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 r334-tall-171679080600563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S128P18.tgz
mv SemanticWebServices-PT-S128P18 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 ;