Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 9.0K Apr 12 02:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 02:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 227K 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-S128P15-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717228566164

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:56:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:56:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:56:07] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-01 07:56:07] [INFO ] Transformed 188 places.
[2024-06-01 07:56:07] [INFO ] Transformed 416 transitions.
[2024-06-01 07:56:07] [INFO ] Parsed PT model containing 188 places and 416 transitions and 1593 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 220 transitions
Reduce redundant transitions removed 220 transitions.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Ensure Unique test removed 27 places
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 87 transition count 92
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 207 place count 81 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 213 place count 81 transition count 86
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 218 place count 76 transition count 81
Iterating global reduction 1 with 5 rules applied. Total rules applied 223 place count 76 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 225 place count 74 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 227 place count 74 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 228 place count 73 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 229 place count 73 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 230 place count 72 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 231 place count 72 transition count 77
Applied a total of 231 rules in 59 ms. Remains 72 /186 variables (removed 114) and now considering 77/194 (removed 117) transitions.
[2024-06-01 07:56:07] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
// Phase 1: matrix 68 rows 72 cols
[2024-06-01 07:56:07] [INFO ] Computed 8 invariants in 7 ms
[2024-06-01 07:56:07] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 07:56:07] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2024-06-01 07:56:07] [INFO ] Invariant cache hit.
[2024-06-01 07:56:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 07:56:08] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-06-01 07:56:08] [INFO ] Flow matrix only has 68 transitions (discarded 9 similar events)
[2024-06-01 07:56:08] [INFO ] Invariant cache hit.
[2024-06-01 07:56:08] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 67/139 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/140 variables, and 137 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1067 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 67/139 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 57/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 71/208 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/140 variables, and 208 constraints, problems are : Problem set: 0 solved, 71 unsolved in 840 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 1966ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 1979ms
Starting structural reductions in LTL mode, iteration 1 : 72/186 places, 77/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2348 ms. Remains : 72/186 places, 77/194 transitions.
Support contains 20 out of 72 places after structural reductions.
[2024-06-01 07:56:10] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:56:10] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:56:10] [INFO ] Input system was already deterministic with 77 transitions.
RANDOM walk for 40000 steps (10 resets) in 735 ms. (54 steps per ms) remains 0/10 properties
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(p0))&&F(p1))))))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 64 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 64 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 64 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 63 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 62 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 61 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 59 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 59 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 59 transition count 68
Applied a total of 22 rules in 16 ms. Remains 59 /72 variables (removed 13) and now considering 68/77 (removed 9) transitions.
[2024-06-01 07:56:10] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
// Phase 1: matrix 60 rows 59 cols
[2024-06-01 07:56:10] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:56:10] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 07:56:10] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
[2024-06-01 07:56:10] [INFO ] Invariant cache hit.
[2024-06-01 07:56:10] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 07:56:10] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-06-01 07:56:10] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
[2024-06-01 07:56:10] [INFO ] Invariant cache hit.
[2024-06-01 07:56:10] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 2/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 59/118 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 111 constraints, problems are : Problem set: 0 solved, 63 unsolved in 696 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 2/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 59/118 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 63/174 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 174 constraints, problems are : Problem set: 0 solved, 63 unsolved in 592 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1301ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1306ms
Starting structural reductions in LTL mode, iteration 1 : 59/72 places, 68/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1415 ms. Remains : 59/72 places, 68/77 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-01 finished in 1900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((X(!p0)&&F(!p1))||G(!p0))))))'
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 67 transition count 77
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 64 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 64 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 64 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 62 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 61 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 60 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 60 transition count 69
Applied a total of 20 rules in 15 ms. Remains 60 /72 variables (removed 12) and now considering 69/77 (removed 8) transitions.
[2024-06-01 07:56:12] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
// Phase 1: matrix 60 rows 60 cols
[2024-06-01 07:56:12] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 07:56:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 07:56:12] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-06-01 07:56:12] [INFO ] Invariant cache hit.
[2024-06-01 07:56:12] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 07:56:12] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 07:56:12] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-06-01 07:56:12] [INFO ] Invariant cache hit.
[2024-06-01 07:56:12] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 113 constraints, problems are : Problem set: 0 solved, 64 unsolved in 687 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 64/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 177 constraints, problems are : Problem set: 0 solved, 64 unsolved in 582 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1279ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1280ms
Starting structural reductions in LTL mode, iteration 1 : 60/72 places, 69/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1388 ms. Remains : 60/72 places, 69/77 transitions.
Stuttering acceptance computed with spot in 192 ms :[p0, p0, (AND p1 p0), p0, p0]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 214 ms.
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[p0, p0, (AND p0 p1), p0, p0]
RANDOM walk for 3970 steps (2 resets) in 87 ms. (45 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p0, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 238 ms :[p0, p0, (AND p0 p1), p0, p0]
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-06-01 07:56:15] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-06-01 07:56:15] [INFO ] Invariant cache hit.
[2024-06-01 07:56:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 07:56:15] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-06-01 07:56:15] [INFO ] Invariant cache hit.
[2024-06-01 07:56:15] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 07:56:15] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 07:56:15] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-06-01 07:56:15] [INFO ] Invariant cache hit.
[2024-06-01 07:56:15] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 113 constraints, problems are : Problem set: 0 solved, 64 unsolved in 684 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 64/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 177 constraints, problems are : Problem set: 0 solved, 64 unsolved in 622 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1331ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1332ms
Finished structural reductions in LTL mode , in 1 iterations and 1409 ms. Remains : 60/60 places, 69/69 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p0, p0, (AND p0 p1), p0, p0]
RANDOM walk for 13818 steps (4 resets) in 104 ms. (131 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[p0, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 228 ms :[p0, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 180 ms :[p0, p0, (AND p0 p1), p0, p0]
Product exploration explored 100000 steps with 25000 reset in 71 ms.
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 229 ms :[p0, p0, (AND p0 p1), p0, p0]
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Graph (complete) has 132 edges and 60 vertex of which 54 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 53 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 65
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 51 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 51 transition count 63
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 48 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 48 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 15 place count 46 transition count 58
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 46 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 44 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 44 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 23 place count 42 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 25 place count 42 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 27 place count 42 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 42 transition count 49
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 91 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 40 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 40 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 39 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 38 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 38 transition count 46
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 36 transition count 44
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 36 transition count 44
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 33 transition count 41
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 33 transition count 41
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 29 transition count 37
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 29 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 58 place count 29 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 29 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 28 transition count 32
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 61 place count 27 transition count 31
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 27 transition count 31
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 63 place count 26 transition count 30
Iterating global reduction 5 with 1 rules applied. Total rules applied 64 place count 26 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 25 transition count 29
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 25 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 25 transition count 28
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 68 place count 25 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 69 place count 24 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 70 place count 23 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 71 place count 23 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 72 place count 22 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 73 place count 22 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 74 place count 22 transition count 24
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 75 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 76 place count 21 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 77 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 78 place count 20 transition count 22
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 79 place count 20 transition count 21
Applied a total of 79 rules in 42 ms. Remains 20 /60 variables (removed 40) and now considering 21/69 (removed 48) transitions.
[2024-06-01 07:56:18] [INFO ] Redundant transitions in 23 ms returned []
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 20 cols
[2024-06-01 07:56:18] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 07:56:18] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/41 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 178 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 20/20 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 3/38 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/41 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 20/20 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 336ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 336ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/60 places, 21/69 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 409 ms. Remains : 20/60 places, 21/69 transitions.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-06-01 07:56:19] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
// Phase 1: matrix 60 rows 60 cols
[2024-06-01 07:56:19] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 07:56:19] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:56:19] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-06-01 07:56:19] [INFO ] Invariant cache hit.
[2024-06-01 07:56:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 07:56:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 07:56:19] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-06-01 07:56:19] [INFO ] Invariant cache hit.
[2024-06-01 07:56:19] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 113 constraints, problems are : Problem set: 0 solved, 64 unsolved in 654 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/119 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 64/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 177 constraints, problems are : Problem set: 0 solved, 64 unsolved in 602 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1264ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1265ms
Finished structural reductions in LTL mode , in 1 iterations and 1332 ms. Remains : 60/60 places, 69/69 transitions.
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-03 finished in 8054 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(G((p0||G(p1)))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 77
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 63 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 63 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 60 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 60 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 58 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 58 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 56 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 56 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 55 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 55 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 54 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 54 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 54 transition count 64
Applied a total of 31 rules in 7 ms. Remains 54 /72 variables (removed 18) and now considering 64/77 (removed 13) transitions.
[2024-06-01 07:56:20] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
// Phase 1: matrix 56 rows 54 cols
[2024-06-01 07:56:20] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:56:20] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:56:20] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
[2024-06-01 07:56:20] [INFO ] Invariant cache hit.
[2024-06-01 07:56:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 07:56:20] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-06-01 07:56:20] [INFO ] Flow matrix only has 56 transitions (discarded 8 similar events)
[2024-06-01 07:56:20] [INFO ] Invariant cache hit.
[2024-06-01 07:56:20] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 55/109 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 101 constraints, problems are : Problem set: 0 solved, 58 unsolved in 577 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 55/109 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 58/159 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 159 constraints, problems are : Problem set: 0 solved, 58 unsolved in 515 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 1097ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 1098ms
Starting structural reductions in LTL mode, iteration 1 : 54/72 places, 64/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 54/72 places, 64/77 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-04 finished in 1349 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(G(p0)))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 62 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 62 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 59 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 59 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 57 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 57 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 55 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 55 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 54 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 54 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 53 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 53 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 53 transition count 62
Applied a total of 34 rules in 12 ms. Remains 53 /72 variables (removed 19) and now considering 62/77 (removed 15) transitions.
[2024-06-01 07:56:21] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
// Phase 1: matrix 54 rows 53 cols
[2024-06-01 07:56:21] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 07:56:21] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 07:56:21] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
[2024-06-01 07:56:21] [INFO ] Invariant cache hit.
[2024-06-01 07:56:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 07:56:22] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-06-01 07:56:22] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
[2024-06-01 07:56:22] [INFO ] Invariant cache hit.
[2024-06-01 07:56:22] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 2/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 53/106 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 44/99 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/107 variables, and 99 constraints, problems are : Problem set: 0 solved, 57 unsolved in 545 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 2/53 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 53/106 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 44/99 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 57/156 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/107 variables, and 156 constraints, problems are : Problem set: 0 solved, 57 unsolved in 499 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1050ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1052ms
Starting structural reductions in LTL mode, iteration 1 : 53/72 places, 62/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1140 ms. Remains : 53/72 places, 62/77 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-05 finished in 1266 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(G(p0)))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 62 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 62 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 59 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 59 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 57 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 57 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 55 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 55 transition count 65
Applied a total of 29 rules in 4 ms. Remains 55 /72 variables (removed 17) and now considering 65/77 (removed 12) transitions.
[2024-06-01 07:56:23] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
// Phase 1: matrix 56 rows 55 cols
[2024-06-01 07:56:23] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:56:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 07:56:23] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2024-06-01 07:56:23] [INFO ] Invariant cache hit.
[2024-06-01 07:56:23] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 07:56:23] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 07:56:23] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2024-06-01 07:56:23] [INFO ] Invariant cache hit.
[2024-06-01 07:56:23] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 55/110 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 46/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/111 variables, and 103 constraints, problems are : Problem set: 0 solved, 60 unsolved in 600 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 55/110 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 46/103 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 60/163 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/111 variables, and 163 constraints, problems are : Problem set: 0 solved, 60 unsolved in 501 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1110ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1111ms
Starting structural reductions in LTL mode, iteration 1 : 55/72 places, 65/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1189 ms. Remains : 55/72 places, 65/77 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-06 finished in 1291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Graph (complete) has 179 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 53 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 53 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 53 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 48 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 48 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 43 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 43 transition count 57
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 39 transition count 53
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 39 transition count 53
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 36 transition count 50
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 36 transition count 50
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 33 transition count 47
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 33 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 33 transition count 44
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 57 place count 33 transition count 42
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 69 edges and 32 vertex of which 31 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 59 place count 31 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 31 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 30 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 29 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 29 transition count 39
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 27 transition count 37
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 27 transition count 37
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 70 place count 24 transition count 34
Iterating global reduction 4 with 3 rules applied. Total rules applied 73 place count 24 transition count 34
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 77 place count 20 transition count 30
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 20 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 85 place count 20 transition count 26
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 86 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 19 transition count 25
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 88 place count 18 transition count 24
Iterating global reduction 6 with 1 rules applied. Total rules applied 89 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 90 place count 17 transition count 23
Iterating global reduction 6 with 1 rules applied. Total rules applied 91 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 92 place count 16 transition count 22
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 16 transition count 21
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 95 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 96 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 97 place count 14 transition count 19
Iterating global reduction 8 with 1 rules applied. Total rules applied 98 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 99 place count 13 transition count 18
Iterating global reduction 8 with 1 rules applied. Total rules applied 100 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 101 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 102 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 103 place count 12 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 104 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 105 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 106 place count 11 transition count 14
Applied a total of 106 rules in 22 ms. Remains 11 /72 variables (removed 61) and now considering 14/77 (removed 63) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-06-01 07:56:24] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:56:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 07:56:24] [INFO ] Invariant cache hit.
[2024-06-01 07:56:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:56:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 07:56:24] [INFO ] Redundant transitions in 14 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 07:56:24] [INFO ] Invariant cache hit.
[2024-06-01 07:56:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 58 ms.
Refiners :[State Equation: 10/11 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/24 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 67 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/72 places, 14/77 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 11/72 places, 14/77 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-07 finished in 316 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 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 61 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 61 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 61 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 58 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 58 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 56 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 56 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 54 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 54 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 53 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 53 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 52 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 52 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 52 transition count 62
Applied a total of 35 rules in 6 ms. Remains 52 /72 variables (removed 20) and now considering 62/77 (removed 15) transitions.
[2024-06-01 07:56:24] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
// Phase 1: matrix 54 rows 52 cols
[2024-06-01 07:56:24] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:56:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 07:56:24] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
[2024-06-01 07:56:24] [INFO ] Invariant cache hit.
[2024-06-01 07:56:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 07:56:24] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-06-01 07:56:24] [INFO ] Flow matrix only has 54 transitions (discarded 8 similar events)
[2024-06-01 07:56:24] [INFO ] Invariant cache hit.
[2024-06-01 07:56:24] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 2/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 53/105 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 97 constraints, problems are : Problem set: 0 solved, 57 unsolved in 658 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 2/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 53/105 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 57/154 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 154 constraints, problems are : Problem set: 0 solved, 57 unsolved in 477 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1144ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1145ms
Starting structural reductions in LTL mode, iteration 1 : 52/72 places, 62/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1223 ms. Remains : 52/72 places, 62/77 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-08 finished in 1323 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 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Graph (complete) has 179 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 54 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 54 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 54 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 49 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 49 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 44 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 44 transition count 57
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 40 transition count 53
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 40 transition count 53
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 37 transition count 50
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 37 transition count 50
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 34 transition count 47
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 34 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 34 transition count 44
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 57 place count 34 transition count 42
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 74 edges and 33 vertex of which 32 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 59 place count 32 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 32 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 30 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 30 transition count 39
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 28 transition count 37
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 28 transition count 37
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 70 place count 25 transition count 34
Iterating global reduction 4 with 3 rules applied. Total rules applied 73 place count 25 transition count 34
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 77 place count 21 transition count 30
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 21 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 85 place count 21 transition count 26
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 86 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 20 transition count 25
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 88 place count 19 transition count 24
Iterating global reduction 6 with 1 rules applied. Total rules applied 89 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 90 place count 18 transition count 23
Iterating global reduction 6 with 1 rules applied. Total rules applied 91 place count 18 transition count 23
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 92 place count 17 transition count 22
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 17 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 17 transition count 21
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 95 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 96 place count 16 transition count 20
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 97 place count 15 transition count 19
Iterating global reduction 8 with 1 rules applied. Total rules applied 98 place count 15 transition count 19
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 99 place count 14 transition count 18
Iterating global reduction 8 with 1 rules applied. Total rules applied 100 place count 14 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 101 place count 14 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 102 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 103 place count 13 transition count 16
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 104 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 105 place count 12 transition count 15
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 106 place count 12 transition count 14
Applied a total of 106 rules in 23 ms. Remains 12 /72 variables (removed 60) and now considering 14/77 (removed 63) transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-06-01 07:56:26] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:56:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:56:26] [INFO ] Invariant cache hit.
[2024-06-01 07:56:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:56:26] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 07:56:26] [INFO ] Redundant transitions in 14 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 07:56:26] [INFO ] Invariant cache hit.
[2024-06-01 07:56:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 11/21 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/26 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 65 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 11/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 11/21 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/23 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/25 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 73 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/72 places, 14/77 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 12/72 places, 14/77 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-15 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((X(!p0)&&F(!p1))||G(!p0))))))'
Found a Shortening insensitive property : SemanticWebServices-PT-S128P15-LTLFireability-03
Stuttering acceptance computed with spot in 275 ms :[p0, p0, (AND p1 p0), p0, p0]
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 72/72 places, 77/77 transitions.
Graph (complete) has 179 edges and 72 vertex of which 66 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 56 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 56 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 56 transition count 68
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 52 transition count 64
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 52 transition count 64
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 48 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 48 transition count 60
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 45 transition count 57
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 45 transition count 57
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 43 transition count 55
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 43 transition count 55
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 41 transition count 53
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 41 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 41 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 41 transition count 48
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 90 edges and 40 vertex of which 39 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 2 with 2 rules applied. Total rules applied 47 place count 39 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 39 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 38 transition count 46
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 37 transition count 45
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 37 transition count 45
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 35 transition count 43
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 35 transition count 43
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 32 transition count 40
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 32 transition count 40
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 65 place count 28 transition count 36
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 28 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 73 place count 28 transition count 32
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 74 place count 28 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 75 place count 27 transition count 31
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 76 place count 26 transition count 30
Iterating global reduction 6 with 1 rules applied. Total rules applied 77 place count 26 transition count 30
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 78 place count 25 transition count 29
Iterating global reduction 6 with 1 rules applied. Total rules applied 79 place count 25 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 80 place count 24 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 24 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 82 place count 24 transition count 27
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 83 place count 24 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 84 place count 23 transition count 26
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 85 place count 22 transition count 25
Iterating global reduction 8 with 1 rules applied. Total rules applied 86 place count 22 transition count 25
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 87 place count 21 transition count 24
Iterating global reduction 8 with 1 rules applied. Total rules applied 88 place count 21 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 89 place count 21 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 90 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 91 place count 20 transition count 22
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 92 place count 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 93 place count 19 transition count 21
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 94 place count 19 transition count 20
Applied a total of 94 rules in 15 ms. Remains 19 /72 variables (removed 53) and now considering 20/77 (removed 57) transitions.
// Phase 1: matrix 20 rows 19 cols
[2024-06-01 07:56:26] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 07:56:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 07:56:26] [INFO ] Invariant cache hit.
[2024-06-01 07:56:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:56:26] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-06-01 07:56:26] [INFO ] Invariant cache hit.
[2024-06-01 07:56:26] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/39 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 134 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/36 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/37 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/38 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 154 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 292ms
Starting structural reductions in LI_LTL mode, iteration 1 : 19/72 places, 20/77 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 355 ms. Remains : 19/72 places, 20/77 transitions.
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 80 ms.
Product exploration explored 100000 steps with 25000 reset in 93 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p0, p0, (AND p0 p1), p0, p0]
RANDOM walk for 16847 steps (10 resets) in 121 ms. (138 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[p0, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 204 ms :[p0, p0, (AND p0 p1), p0, p0]
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-06-01 07:56:28] [INFO ] Invariant cache hit.
[2024-06-01 07:56:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 07:56:28] [INFO ] Invariant cache hit.
[2024-06-01 07:56:28] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:56:28] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-06-01 07:56:28] [INFO ] Invariant cache hit.
[2024-06-01 07:56:28] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/39 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 138 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/36 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/37 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/38 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 153 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 295ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 295ms
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 19/19 places, 20/20 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[p0, p0, (AND p0 p1), p0, p0]
RANDOM walk for 33411 steps (13 resets) in 96 ms. (344 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 323 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[p0, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 204 ms :[p0, p0, (AND p0 p1), p0, p0]
Stuttering acceptance computed with spot in 211 ms :[p0, p0, (AND p0 p1), p0, p0]
Product exploration explored 100000 steps with 25000 reset in 54 ms.
Product exploration explored 100000 steps with 25000 reset in 63 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 185 ms :[p0, p0, (AND p0 p1), p0, p0]
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-06-01 07:56:30] [INFO ] Redundant transitions in 16 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 07:56:30] [INFO ] Invariant cache hit.
[2024-06-01 07:56:30] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/39 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 140 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/36 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/37 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/38 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 154 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 307ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 19/19 places, 20/20 transitions.
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-06-01 07:56:30] [INFO ] Invariant cache hit.
[2024-06-01 07:56:30] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:56:30] [INFO ] Invariant cache hit.
[2024-06-01 07:56:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 07:56:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-06-01 07:56:30] [INFO ] Invariant cache hit.
[2024-06-01 07:56:30] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/39 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 134 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 16/32 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/34 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/36 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 1/37 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 1/38 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 159 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 297ms
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 19/19 places, 20/20 transitions.
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-03 finished in 4764 ms.
[2024-06-01 07:56:31] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:56:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2024-06-01 07:56:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 77 transitions and 255 arcs took 4 ms.
Total runtime 23852 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717228591436

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SemanticWebServices-PT-S128P15-LTLFireability-03
ltl formula formula --ltl=/tmp/1279/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 72 places, 77 transitions and 255 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1279/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1279/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1279/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1279/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 73 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 73, there are 91 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 190
pnml2lts-mc( 0/ 4): unique states count: 190
pnml2lts-mc( 0/ 4): unique transitions count: 328
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 218
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 237
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 237 states 621 transitions, fanout: 2.620
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 23.4 B/state, compr.: 8.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 77 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SemanticWebServices-PT-S128P15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679080600556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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