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.r333-tall-171679078600524.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 greatspnxred
Input is SemanticWebServices-PT-S064P18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078600524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 02:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 12 02:52 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 173K 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-S064P18-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S064P18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716873264141

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:14:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:14:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:14:25] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-28 05:14:25] [INFO ] Transformed 154 places.
[2024-05-28 05:14:25] [INFO ] Transformed 236 transitions.
[2024-05-28 05:14:25] [INFO ] Parsed PT model containing 154 places and 236 transitions and 1265 arcs in 182 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 1 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 112/112 transitions.
Ensure Unique test removed 34 places
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 116 transition count 112
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 110 transition count 106
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 110 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 110 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 107 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 107 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 105 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 105 transition count 100
Applied a total of 59 rules in 38 ms. Remains 105 /152 variables (removed 47) and now considering 100/112 (removed 12) transitions.
[2024-05-28 05:14:25] [INFO ] Flow matrix only has 91 transitions (discarded 9 similar events)
// Phase 1: matrix 91 rows 105 cols
[2024-05-28 05:14:25] [INFO ] Computed 16 invariants in 7 ms
[2024-05-28 05:14:25] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-28 05:14:25] [INFO ] Flow matrix only has 91 transitions (discarded 9 similar events)
[2024-05-28 05:14:25] [INFO ] Invariant cache hit.
[2024-05-28 05:14:25] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-28 05:14:25] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-28 05:14:25] [INFO ] Flow matrix only has 91 transitions (discarded 9 similar events)
[2024-05-28 05:14:25] [INFO ] Invariant cache hit.
[2024-05-28 05:14:25] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 91/196 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 82/203 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 203 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1719 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 105/105 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 91/196 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 82/203 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 96/299 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 299 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1384 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 105/105 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 3134ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 3147ms
Starting structural reductions in LTL mode, iteration 1 : 105/152 places, 100/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3508 ms. Remains : 105/152 places, 100/112 transitions.
Support contains 40 out of 105 places after structural reductions.
[2024-05-28 05:14:29] [INFO ] Flatten gal took : 24 ms
[2024-05-28 05:14:29] [INFO ] Flatten gal took : 9 ms
[2024-05-28 05:14:29] [INFO ] Input system was already deterministic with 100 transitions.
RANDOM walk for 37074 steps (9 resets) in 1326 ms. (27 steps per ms) remains 0/25 properties
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 262 edges and 105 vertex of which 99 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 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)||(p1&&X(F(!p1))))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 91 transition count 100
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 85 transition count 94
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 85 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 79 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 79 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 73 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 73 transition count 82
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 68 transition count 77
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 68 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 67 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 67 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 67 transition count 75
Applied a total of 63 rules in 15 ms. Remains 67 /105 variables (removed 38) and now considering 75/100 (removed 25) transitions.
[2024-05-28 05:14:30] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
// Phase 1: matrix 67 rows 67 cols
[2024-05-28 05:14:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:14:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 05:14:30] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
[2024-05-28 05:14:30] [INFO ] Invariant cache hit.
[2024-05-28 05:14:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 05:14:30] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-28 05:14:30] [INFO ] Flow matrix only has 67 transitions (discarded 8 similar events)
[2024-05-28 05:14:30] [INFO ] Invariant cache hit.
[2024-05-28 05:14:30] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 67/134 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 58/127 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 127 constraints, problems are : Problem set: 0 solved, 71 unsolved in 865 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 58/58 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/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 67/134 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 58/127 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/198 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 198 constraints, problems are : Problem set: 0 solved, 71 unsolved in 702 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 1581ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 1583ms
Starting structural reductions in LTL mode, iteration 1 : 67/105 places, 75/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1705 ms. Remains : 67/105 places, 75/100 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 142 edges and 67 vertex of which 61 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/67 stabilizing places and 9/75 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-01 finished in 2492 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 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Graph (complete) has 262 edges and 105 vertex of which 99 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 14 places
Reduce places removed 15 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 78 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 78 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 72 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 72 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 66 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 66 transition count 78
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 60 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 60 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 52 place count 57 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 55 place count 57 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 56 place count 57 transition count 68
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 55 transition count 66
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 55 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 54 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 54 transition count 65
Applied a total of 62 rules in 27 ms. Remains 54 /105 variables (removed 51) and now considering 65/100 (removed 35) transitions.
[2024-05-28 05:14:32] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
// Phase 1: matrix 56 rows 54 cols
[2024-05-28 05:14:32] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:14:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:14:32] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2024-05-28 05:14:32] [INFO ] Invariant cache hit.
[2024-05-28 05:14:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 05:14:32] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-28 05:14:32] [INFO ] Redundant transitions in 2 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-28 05:14:32] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2024-05-28 05:14:32] [INFO ] Invariant cache hit.
[2024-05-28 05:14:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 54/106 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/107 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/110 variables, and 95 constraints, problems are : Problem set: 0 solved, 51 unsolved in 772 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/54 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 54/106 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 1/108 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 1/109 variables, 10/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 1/110 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 0/110 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 147 constraints, problems are : Problem set: 0 solved, 51 unsolved in 861 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 1641ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1642ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/105 places, 65/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1745 ms. Remains : 54/105 places, 65/100 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-02
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-02 finished in 1799 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 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 91 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 86 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 86 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 81 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 81 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 76 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 76 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 71 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 71 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 69 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 69 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 69 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 68 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 68 transition count 76
Applied a total of 61 rules in 7 ms. Remains 68 /105 variables (removed 37) and now considering 76/100 (removed 24) transitions.
[2024-05-28 05:14:34] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 68 cols
[2024-05-28 05:14:34] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 05:14:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 05:14:34] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2024-05-28 05:14:34] [INFO ] Invariant cache hit.
[2024-05-28 05:14:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 05:14:34] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-28 05:14:34] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2024-05-28 05:14:34] [INFO ] Invariant cache hit.
[2024-05-28 05:14:34] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 129 constraints, problems are : Problem set: 0 solved, 72 unsolved in 815 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 68/136 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/201 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 201 constraints, problems are : Problem set: 0 solved, 72 unsolved in 731 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 1555ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 1556ms
Starting structural reductions in LTL mode, iteration 1 : 68/105 places, 76/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1654 ms. Remains : 68/105 places, 76/100 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-04 finished in 1755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(!p0)&&X(G(!p1))))||(F(!p0)&&X(G(!p1))&&F(p2)))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Graph (complete) has 262 edges and 105 vertex of which 99 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 13 places
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 79 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 79 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 72 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 72 transition count 83
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 36 place count 65 transition count 76
Iterating global reduction 0 with 7 rules applied. Total rules applied 43 place count 65 transition count 76
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 49 place count 59 transition count 70
Iterating global reduction 0 with 6 rules applied. Total rules applied 55 place count 59 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 58 place count 56 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 61 place count 56 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 56 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 55 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 55 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 54 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 54 transition count 64
Applied a total of 66 rules in 20 ms. Remains 54 /105 variables (removed 51) and now considering 64/100 (removed 36) transitions.
[2024-05-28 05:14:36] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 54 cols
[2024-05-28 05:14:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:14:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 05:14:36] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:14:36] [INFO ] Invariant cache hit.
[2024-05-28 05:14:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 05:14:36] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-28 05:14:36] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 05:14:36] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:14:36] [INFO ] Invariant cache hit.
[2024-05-28 05:14:36] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 54/106 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 48/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 105 constraints, problems are : Problem set: 0 solved, 60 unsolved in 850 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 49/49 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/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 54/106 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 48/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 60/162 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 2/108 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/109 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 165 constraints, problems are : Problem set: 0 solved, 60 unsolved in 695 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1553ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1554ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/105 places, 64/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1664 ms. Remains : 54/105 places, 64/100 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR p0 p1), p1, (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) p0), p0]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-05
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-05 finished in 1949 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 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 91 transition count 100
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 85 transition count 94
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 85 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 79 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 79 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 73 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 73 transition count 82
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 67 transition count 76
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 67 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 65 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 65 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 67 place count 65 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 64 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 64 transition count 72
Applied a total of 69 rules in 8 ms. Remains 64 /105 variables (removed 41) and now considering 72/100 (removed 28) transitions.
[2024-05-28 05:14:38] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
// Phase 1: matrix 64 rows 64 cols
[2024-05-28 05:14:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:14:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 05:14:38] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2024-05-28 05:14:38] [INFO ] Invariant cache hit.
[2024-05-28 05:14:38] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 05:14:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-28 05:14:38] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2024-05-28 05:14:38] [INFO ] Invariant cache hit.
[2024-05-28 05:14:38] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 64/128 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 55/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 121 constraints, problems are : Problem set: 0 solved, 68 unsolved in 737 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 2/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 64/128 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 55/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/189 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 189 constraints, problems are : Problem set: 0 solved, 68 unsolved in 630 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 1372ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 1373ms
Starting structural reductions in LTL mode, iteration 1 : 64/105 places, 72/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1455 ms. Remains : 64/105 places, 72/100 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 275 ms.
Entered a terminal (fully accepting) state of product in 120 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-06 finished in 1823 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(F(p0)) U G((!p1&&F(!p0))))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Ensure Unique test removed 13 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 92 transition count 100
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 86 transition count 94
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 86 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 80 transition count 88
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 80 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 74 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 74 transition count 82
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 68 transition count 76
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 68 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 66 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 66 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 66 place count 66 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 65 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 65 transition count 72
Applied a total of 68 rules in 4 ms. Remains 65 /105 variables (removed 40) and now considering 72/100 (removed 28) transitions.
[2024-05-28 05:14:39] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
// Phase 1: matrix 64 rows 65 cols
[2024-05-28 05:14:39] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 05:14:39] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-28 05:14:39] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2024-05-28 05:14:39] [INFO ] Invariant cache hit.
[2024-05-28 05:14:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 05:14:39] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-28 05:14:39] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2024-05-28 05:14:39] [INFO ] Invariant cache hit.
[2024-05-28 05:14:39] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 64/129 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 55/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 123 constraints, problems are : Problem set: 0 solved, 68 unsolved in 777 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 64/129 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 55/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 68/191 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 191 constraints, problems are : Problem set: 0 solved, 68 unsolved in 657 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 1441ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 1442ms
Starting structural reductions in LTL mode, iteration 1 : 65/105 places, 72/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1532 ms. Remains : 65/105 places, 72/100 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR p0 p1), (OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 183 ms.
Product exploration explored 100000 steps with 1 reset in 409 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 141 edges and 65 vertex of which 59 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 106 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
RANDOM walk for 36676 steps (9 resets) in 212 ms. (172 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 420 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 137 ms :[(OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 72/72 transitions.
Graph (complete) has 141 edges and 65 vertex of which 59 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
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 57 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 57 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 56 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 56 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 55 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 55 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 54 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 54 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 53 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 53 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 52 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 52 transition count 62
Applied a total of 13 rules in 33 ms. Remains 52 /65 variables (removed 13) and now considering 62/72 (removed 10) transitions.
[2024-05-28 05:14:43] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 52 cols
[2024-05-28 05:14:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:14:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 05:14:43] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-05-28 05:14:43] [INFO ] Invariant cache hit.
[2024-05-28 05:14:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 05:14:43] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-28 05:14:43] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-28 05:14:43] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-05-28 05:14:43] [INFO ] Invariant cache hit.
[2024-05-28 05:14:43] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 51/101 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 37/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/105 variables, and 91 constraints, problems are : Problem set: 0 solved, 48 unsolved in 672 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/52 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 51/101 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 37/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 38/127 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 1/102 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/104 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 1/105 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 14 (OVERLAPS) 0/105 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 140 constraints, problems are : Problem set: 0 solved, 48 unsolved in 804 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1493ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/65 places, 62/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1649 ms. Remains : 52/65 places, 62/72 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
RANDOM walk for 26777 steps (7 resets) in 592 ms. (45 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 471 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 145 ms :[(OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering acceptance computed with spot in 156 ms :[(OR p1 p0), (NOT p0), (AND (NOT p0) (NOT p1)), p0]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-07 finished in 6710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Graph (complete) has 262 edges and 105 vertex of which 99 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 14 places
Reduce places removed 15 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 77 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 77 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 70 transition count 82
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 70 transition count 82
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 36 place count 63 transition count 75
Iterating global reduction 0 with 7 rules applied. Total rules applied 43 place count 63 transition count 75
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 50 place count 56 transition count 68
Iterating global reduction 0 with 7 rules applied. Total rules applied 57 place count 56 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 60 place count 53 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 53 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 64 place count 53 transition count 64
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 51 transition count 62
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 51 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 50 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 50 transition count 61
Applied a total of 70 rules in 16 ms. Remains 50 /105 variables (removed 55) and now considering 61/100 (removed 39) transitions.
[2024-05-28 05:14:46] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
// Phase 1: matrix 52 rows 50 cols
[2024-05-28 05:14:46] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:14:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 05:14:46] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
[2024-05-28 05:14:46] [INFO ] Invariant cache hit.
[2024-05-28 05:14:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-28 05:14:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-28 05:14:46] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-28 05:14:46] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
[2024-05-28 05:14:46] [INFO ] Invariant cache hit.
[2024-05-28 05:14:46] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 50/98 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/99 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/100 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/102 variables, and 87 constraints, problems are : Problem set: 0 solved, 47 unsolved in 694 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/50 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 50/98 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 37/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 1/99 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/100 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 1/101 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 1/102 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (OVERLAPS) 0/102 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 135 constraints, problems are : Problem set: 0 solved, 47 unsolved in 777 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1478ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1478ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/105 places, 61/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1569 ms. Remains : 50/105 places, 61/100 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-08
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-08 finished in 1705 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((G(p1)||p0))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Graph (complete) has 262 edges and 105 vertex of which 99 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 14 places
Reduce places removed 15 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 77 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 77 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 70 transition count 82
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 70 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 41 place count 64 transition count 76
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 58 transition count 70
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 58 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 55 place count 56 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 57 place count 56 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 58 place count 56 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 55 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 55 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 54 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 54 transition count 65
Applied a total of 62 rules in 17 ms. Remains 54 /105 variables (removed 51) and now considering 65/100 (removed 35) transitions.
[2024-05-28 05:14:48] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
// Phase 1: matrix 56 rows 54 cols
[2024-05-28 05:14:48] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:14:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 05:14:48] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2024-05-28 05:14:48] [INFO ] Invariant cache hit.
[2024-05-28 05:14:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 05:14:48] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-28 05:14:48] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-28 05:14:48] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2024-05-28 05:14:48] [INFO ] Invariant cache hit.
[2024-05-28 05:14:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 54/106 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/107 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/110 variables, and 95 constraints, problems are : Problem set: 0 solved, 51 unsolved in 750 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/54 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 54/106 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 1/108 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 1/109 variables, 10/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 1/110 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 0/110 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 147 constraints, problems are : Problem set: 0 solved, 51 unsolved in 843 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 1599ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1600ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/105 places, 65/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1701 ms. Remains : 54/105 places, 65/100 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-09
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-09 finished in 1784 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 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Graph (complete) has 262 edges and 105 vertex of which 99 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 15 places
Reduce places removed 16 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 76 transition count 89
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 76 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 69 transition count 82
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 69 transition count 82
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 36 place count 62 transition count 75
Iterating global reduction 0 with 7 rules applied. Total rules applied 43 place count 62 transition count 75
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 50 place count 55 transition count 68
Iterating global reduction 0 with 7 rules applied. Total rules applied 57 place count 55 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 60 place count 52 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 52 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 64 place count 52 transition count 64
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 50 transition count 62
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 50 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 49 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 49 transition count 61
Applied a total of 70 rules in 17 ms. Remains 49 /105 variables (removed 56) and now considering 61/100 (removed 39) transitions.
[2024-05-28 05:14:50] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
// Phase 1: matrix 52 rows 49 cols
[2024-05-28 05:14:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:14:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 05:14:50] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
[2024-05-28 05:14:50] [INFO ] Invariant cache hit.
[2024-05-28 05:14:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-28 05:14:50] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-28 05:14:50] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-28 05:14:50] [INFO ] Flow matrix only has 52 transitions (discarded 9 similar events)
[2024-05-28 05:14:50] [INFO ] Invariant cache hit.
[2024-05-28 05:14:50] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 50/97 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 1/99 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/101 variables, and 85 constraints, problems are : Problem set: 0 solved, 47 unsolved in 599 ms.
Refiners :[State Equation: 48/49 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 50/97 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/100 variables, 10/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 1/101 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/101 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 133 constraints, problems are : Problem set: 0 solved, 47 unsolved in 732 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1336ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1337ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/105 places, 61/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1424 ms. Remains : 49/105 places, 61/100 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-10 finished in 1690 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((X(!p0) U ((X(!p0)&&G(p1))||X(G(!p0)))))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 91 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 87 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 87 transition count 96
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 83 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 83 transition count 92
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 79 transition count 88
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 79 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 75 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 75 transition count 84
Applied a total of 46 rules in 5 ms. Remains 75 /105 variables (removed 30) and now considering 84/100 (removed 16) transitions.
[2024-05-28 05:14:51] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
// Phase 1: matrix 75 rows 75 cols
[2024-05-28 05:14:51] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 05:14:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 05:14:51] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-28 05:14:51] [INFO ] Invariant cache hit.
[2024-05-28 05:14:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-28 05:14:51] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-28 05:14:51] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-28 05:14:51] [INFO ] Invariant cache hit.
[2024-05-28 05:14:51] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/150 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 143 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1025 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/150 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 80/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 223 constraints, problems are : Problem set: 0 solved, 80 unsolved in 899 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 1931ms
Starting structural reductions in LTL mode, iteration 1 : 75/105 places, 84/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2033 ms. Remains : 75/105 places, 84/100 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (AND (NOT p1) p0), (NOT p1), p0, p0, p0, p0, p0]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 159 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 8 states, 17 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p1), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0, p0, p0, p0]
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-28 05:14:55] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-28 05:14:55] [INFO ] Invariant cache hit.
[2024-05-28 05:14:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 05:14:55] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-28 05:14:55] [INFO ] Invariant cache hit.
[2024-05-28 05:14:55] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-28 05:14:55] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-28 05:14:55] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-28 05:14:55] [INFO ] Invariant cache hit.
[2024-05-28 05:14:55] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/150 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 143 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1384 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/150 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 80/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 223 constraints, problems are : Problem set: 0 solved, 80 unsolved in 901 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 2295ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2296ms
Finished structural reductions in LTL mode , in 1 iterations and 2408 ms. Remains : 75/75 places, 84/84 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 159 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0, p0, p0, p0]
RANDOM walk for 21255 steps (6 resets) in 113 ms. (186 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p1), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 407 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 300 ms.
Product exploration explored 100000 steps with 0 reset in 333 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0, p0, p0, p0]
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 84/84 transitions.
Graph (complete) has 159 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 68 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 68 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 67 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 67 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 66 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 65 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 64 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 63 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 62 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 62 transition count 74
Applied a total of 15 rules in 22 ms. Remains 62 /75 variables (removed 13) and now considering 74/84 (removed 10) transitions.
[2024-05-28 05:15:00] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-28 05:15:00] [INFO ] Flow matrix only has 64 transitions (discarded 10 similar events)
// Phase 1: matrix 64 rows 62 cols
[2024-05-28 05:15:01] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:15:01] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 63/123 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 121 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1128 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 63/123 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 57/118 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 70/188 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 2/125 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 191 constraints, problems are : Problem set: 0 solved, 70 unsolved in 906 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 2042ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2043ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/75 places, 74/84 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2071 ms. Remains : 62/75 places, 74/84 transitions.
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-28 05:15:03] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
// Phase 1: matrix 75 rows 75 cols
[2024-05-28 05:15:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 05:15:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 05:15:03] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-28 05:15:03] [INFO ] Invariant cache hit.
[2024-05-28 05:15:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-28 05:15:03] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-28 05:15:03] [INFO ] Flow matrix only has 75 transitions (discarded 9 similar events)
[2024-05-28 05:15:03] [INFO ] Invariant cache hit.
[2024-05-28 05:15:03] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/150 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 143 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1000 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/150 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 80/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 223 constraints, problems are : Problem set: 0 solved, 80 unsolved in 881 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 1890ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 1891ms
Finished structural reductions in LTL mode , in 1 iterations and 1976 ms. Remains : 75/75 places, 84/84 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-11 finished in 13322 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 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Graph (complete) has 262 edges and 105 vertex of which 99 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 14 places
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 78 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 78 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 71 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 71 transition count 83
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 36 place count 64 transition count 76
Iterating global reduction 0 with 7 rules applied. Total rules applied 43 place count 64 transition count 76
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 50 place count 57 transition count 69
Iterating global reduction 0 with 7 rules applied. Total rules applied 57 place count 57 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 60 place count 54 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 54 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 64 place count 54 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 52 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 52 transition count 63
Applied a total of 68 rules in 16 ms. Remains 52 /105 variables (removed 53) and now considering 63/100 (removed 37) transitions.
[2024-05-28 05:15:05] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
// Phase 1: matrix 54 rows 52 cols
[2024-05-28 05:15:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:15:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 05:15:05] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2024-05-28 05:15:05] [INFO ] Invariant cache hit.
[2024-05-28 05:15:05] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 05:15:05] [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.
[2024-05-28 05:15:05] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-28 05:15:05] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2024-05-28 05:15:05] [INFO ] Invariant cache hit.
[2024-05-28 05:15:05] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 53/103 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 2/105 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/106 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 101 constraints, problems are : Problem set: 0 solved, 59 unsolved in 832 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 53/103 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 59/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 2/105 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 160 constraints, problems are : Problem set: 0 solved, 59 unsolved in 690 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 1527ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1528ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/105 places, 63/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1621 ms. Remains : 52/105 places, 63/100 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 211 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10062 steps (2 resets) in 26 ms. (372 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 05:15:07] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2024-05-28 05:15:07] [INFO ] Invariant cache hit.
[2024-05-28 05:15:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 05:15:07] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2024-05-28 05:15:07] [INFO ] Invariant cache hit.
[2024-05-28 05:15:07] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 05:15:07] [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.
[2024-05-28 05:15:07] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-28 05:15:07] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2024-05-28 05:15:07] [INFO ] Invariant cache hit.
[2024-05-28 05:15:07] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 53/103 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 2/105 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/106 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 101 constraints, problems are : Problem set: 0 solved, 59 unsolved in 868 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 53/103 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 59/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 2/105 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 160 constraints, problems are : Problem set: 0 solved, 59 unsolved in 688 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 1560ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1561ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1643 ms. Remains : 52/52 places, 63/63 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30075 steps (7 resets) in 55 ms. (537 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 161 ms.
Product exploration explored 100000 steps with 1 reset in 280 ms.
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 05:15:10] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2024-05-28 05:15:10] [INFO ] Invariant cache hit.
[2024-05-28 05:15:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:15:10] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2024-05-28 05:15:10] [INFO ] Invariant cache hit.
[2024-05-28 05:15:10] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 05:15:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-28 05:15:10] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-28 05:15:10] [INFO ] Flow matrix only has 54 transitions (discarded 9 similar events)
[2024-05-28 05:15:10] [INFO ] Invariant cache hit.
[2024-05-28 05:15:10] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 53/103 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 2/105 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/106 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/106 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 101 constraints, problems are : Problem set: 0 solved, 59 unsolved in 874 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 53/103 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 47/98 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 59/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 2/105 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 160 constraints, problems are : Problem set: 0 solved, 59 unsolved in 689 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 1583ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1584ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1650 ms. Remains : 52/52 places, 63/63 transitions.
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-12 finished in 6750 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((X(p0)&&((!p0 U (p1||G(!p0))) U p2)))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Ensure Unique test removed 14 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 91 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 86 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 86 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 81 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 81 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 76 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 76 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 72 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 72 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 71 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 71 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 70 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 70 transition count 79
Applied a total of 56 rules in 7 ms. Remains 70 /105 variables (removed 35) and now considering 79/100 (removed 21) transitions.
[2024-05-28 05:15:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
// Phase 1: matrix 70 rows 70 cols
[2024-05-28 05:15:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 05:15:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:15:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-28 05:15:11] [INFO ] Invariant cache hit.
[2024-05-28 05:15:11] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-28 05:15:11] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-28 05:15:11] [INFO ] Flow matrix only has 70 transitions (discarded 9 similar events)
[2024-05-28 05:15:11] [INFO ] Invariant cache hit.
[2024-05-28 05:15:11] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 2/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 70/140 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 61/133 constraints. Problems are: Problem set: 0 solved, 75 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 133 constraints, problems are : Problem set: 0 solved, 75 unsolved in 860 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 2/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 70/140 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 61/133 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 75/208 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 208 constraints, problems are : Problem set: 0 solved, 75 unsolved in 754 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 1620ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 1621ms
Starting structural reductions in LTL mode, iteration 1 : 70/105 places, 79/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1730 ms. Remains : 70/105 places, 79/100 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) p0), (NOT p2), false]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stuttering criterion allowed to conclude after 204 steps with 1 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-13 finished in 2107 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 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Graph (complete) has 262 edges and 105 vertex of which 99 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 14 places
Reduce places removed 15 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 78 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 78 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 72 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 72 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 66 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 66 transition count 78
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 60 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 60 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 52 place count 57 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 55 place count 57 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 56 place count 57 transition count 68
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 54 transition count 65
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 54 transition count 65
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 51 transition count 62
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 51 transition count 62
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 49 transition count 60
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 49 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 74 place count 49 transition count 58
Applied a total of 74 rules in 12 ms. Remains 49 /105 variables (removed 56) and now considering 58/100 (removed 42) transitions.
[2024-05-28 05:15:13] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 49 cols
[2024-05-28 05:15:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:15:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 05:15:13] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2024-05-28 05:15:13] [INFO ] Invariant cache hit.
[2024-05-28 05:15:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 05:15:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 05:15:14] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-28 05:15:14] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2024-05-28 05:15:14] [INFO ] Invariant cache hit.
[2024-05-28 05:15:14] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 49/96 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 37/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/97 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/100 variables, and 87 constraints, problems are : Problem set: 0 solved, 46 unsolved in 582 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/49 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 49/96 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 37/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 38/123 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/97 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/98 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/99 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 1/100 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (OVERLAPS) 0/100 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 134 constraints, problems are : Problem set: 0 solved, 46 unsolved in 710 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1295ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/105 places, 58/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1370 ms. Remains : 49/105 places, 58/100 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-14
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-14 finished in 1417 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(p0)||((X(p1) U p2)&&G(!p1))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 100/100 transitions.
Graph (complete) has 262 edges and 105 vertex of which 99 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 14 places
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 78 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 78 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 72 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 72 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 33 place count 66 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 66 transition count 78
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 45 place count 60 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 51 place count 60 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 58 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 58 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 57 place count 56 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 56 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 60 place count 55 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 55 transition count 67
Applied a total of 61 rules in 7 ms. Remains 55 /105 variables (removed 50) and now considering 67/100 (removed 33) transitions.
[2024-05-28 05:15:15] [INFO ] Flow matrix only has 57 transitions (discarded 10 similar events)
// Phase 1: matrix 57 rows 55 cols
[2024-05-28 05:15:15] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:15:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 05:15:15] [INFO ] Flow matrix only has 57 transitions (discarded 10 similar events)
[2024-05-28 05:15:15] [INFO ] Invariant cache hit.
[2024-05-28 05:15:15] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-28 05:15:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-28 05:15:15] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-28 05:15:15] [INFO ] Flow matrix only has 57 transitions (discarded 10 similar events)
[2024-05-28 05:15:15] [INFO ] Invariant cache hit.
[2024-05-28 05:15:15] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 56/109 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 2/111 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/112 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 107 constraints, problems are : Problem set: 0 solved, 63 unsolved in 956 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 51/51 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/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 56/109 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 2/111 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 1/112 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/112 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 170 constraints, problems are : Problem set: 0 solved, 63 unsolved in 735 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1698ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/105 places, 67/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1774 ms. Remains : 55/105 places, 67/100 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P18-LTLFireability-15
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P18-LTLFireability-15 finished in 1906 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((X(!p0) U ((X(!p0)&&G(p1))||X(G(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 05:15:17] [INFO ] Flatten gal took : 15 ms
[2024-05-28 05:15:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-28 05:15:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 100 transitions and 344 arcs took 22 ms.
Total runtime 52272 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SemanticWebServices-PT-S064P18

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 105
TRANSITIONS: 100
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1660
MODEL NAME: /home/mcc/execution/410/model
105 places, 100 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
coverability test failed!!
Convergence in 3 steps.
The state space is infinite.
coverability test failed!!
Convergence in 3 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716873318169

--------------------
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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SemanticWebServices-PT-S064P18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SemanticWebServices-PT-S064P18, 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 r333-tall-171679078600524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S064P18.tgz
mv SemanticWebServices-PT-S064P18 execution
cd execution
if [ "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 ;