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-171679078600499.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-S064P09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078600499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 102K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716872687989

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:04:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:04:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:04:49] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-28 05:04:49] [INFO ] Transformed 100 places.
[2024-05-28 05:04:49] [INFO ] Transformed 164 transitions.
[2024-05-28 05:04:49] [INFO ] Parsed PT model containing 100 places and 164 transitions and 719 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 82/82 transitions.
Ensure Unique test removed 18 places
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 61 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 57 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 57 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 57 transition count 64
Applied a total of 59 rules in 22 ms. Remains 57 /98 variables (removed 41) and now considering 64/82 (removed 18) transitions.
[2024-05-28 05:04:49] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 57 cols
[2024-05-28 05:04:49] [INFO ] Computed 4 invariants in 9 ms
[2024-05-28 05:04:49] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-28 05:04:49] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:04:49] [INFO ] Invariant cache hit.
[2024-05-28 05:04:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 05:04:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 49 sub problems to find dead transitions.
[2024-05-28 05:04:49] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:04:49] [INFO ] Invariant cache hit.
[2024-05-28 05:04:49] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 44/89 variables, 45/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 35/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 12/101 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 11/112 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/112 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 96 constraints, problems are : Problem set: 0 solved, 49 unsolved in 934 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 44/89 variables, 45/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 35/83 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 12/101 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 11/112 variables, 11/144 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (OVERLAPS) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 145 constraints, problems are : Problem set: 0 solved, 49 unsolved in 959 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 57/57 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1920ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1931ms
Starting structural reductions in LTL mode, iteration 1 : 57/98 places, 64/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2227 ms. Remains : 57/98 places, 64/82 transitions.
Support contains 41 out of 57 places after structural reductions.
[2024-05-28 05:04:52] [INFO ] Flatten gal took : 20 ms
[2024-05-28 05:04:52] [INFO ] Flatten gal took : 10 ms
[2024-05-28 05:04:52] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40000 steps (8 resets) in 1569 ms. (25 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/2 properties
[2024-05-28 05:04:52] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 05:04:52] [INFO ] Invariant cache hit.
[2024-05-28 05:04:52] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 24/112 variables, and 14 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Generalized P Invariants (flows): 2/4 constraints, State Equation: 12/57 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 37 transition count 51
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 19 place count 28 transition count 42
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 28 transition count 42
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 19 transition count 33
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 19 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 14 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 14 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 14 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 12 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 10 transition count 15
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 74 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 75 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 76 place count 9 transition count 12
Applied a total of 76 rules in 25 ms. Remains 9 /57 variables (removed 48) and now considering 12/64 (removed 52) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-28 05:04:53] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:04:53] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 05:04:53] [INFO ] Invariant cache hit.
[2024-05-28 05:04:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 05:04:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-28 05:04:53] [INFO ] Redundant transitions in 15 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 05:04:53] [INFO ] Invariant cache hit.
[2024-05-28 05:04:53] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/21 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[State Equation: 7/9 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/18 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[State Equation: 8/9 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/57 places, 12/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 9/57 places, 12/64 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-03
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 4 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-03 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G((p1 U p2))))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 43 transition count 54
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 36 transition count 47
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 36 transition count 47
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 30 transition count 41
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 30 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 30 transition count 39
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 27 transition count 36
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 27 transition count 36
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 27 transition count 33
Applied a total of 61 rules in 3 ms. Remains 27 /57 variables (removed 30) and now considering 33/64 (removed 31) transitions.
[2024-05-28 05:04:53] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 27 cols
[2024-05-28 05:04:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:04:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 05:04:53] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-05-28 05:04:53] [INFO ] Invariant cache hit.
[2024-05-28 05:04:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-28 05:04:53] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-28 05:04:53] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-05-28 05:04:53] [INFO ] Invariant cache hit.
[2024-05-28 05:04:53] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/55 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/56 variables, and 47 constraints, problems are : Problem set: 0 solved, 28 unsolved in 243 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 2/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/56 variables, and 75 constraints, problems are : Problem set: 0 solved, 28 unsolved in 206 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 456ms
Starting structural reductions in LTL mode, iteration 1 : 27/57 places, 33/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 27/57 places, 33/64 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 256 ms.
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-04 finished in 1053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p1 U p2))))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 47 transition count 58
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 39 transition count 50
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 39 transition count 50
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 32 transition count 43
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 32 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 32 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 29 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 29 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 29 transition count 34
Applied a total of 58 rules in 5 ms. Remains 29 /57 variables (removed 28) and now considering 34/64 (removed 30) transitions.
[2024-05-28 05:04:54] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 29 cols
[2024-05-28 05:04:54] [INFO ] Computed 1 invariants in 2 ms
[2024-05-28 05:04:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 05:04:54] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-28 05:04:54] [INFO ] Invariant cache hit.
[2024-05-28 05:04:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 05:04:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 25 sub problems to find dead transitions.
[2024-05-28 05:04:54] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-28 05:04:54] [INFO ] Invariant cache hit.
[2024-05-28 05:04:54] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/57 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 3/60 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 6/57 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 3/60 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 72 constraints, problems are : Problem set: 0 solved, 25 unsolved in 277 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 558ms
Starting structural reductions in LTL mode, iteration 1 : 29/57 places, 34/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 29/57 places, 34/64 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-08
Product exploration explored 100000 steps with 8 reset in 144 ms.
Product exploration explored 100000 steps with 9 reset in 268 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 326 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
RANDOM walk for 10033 steps (3 resets) in 70 ms. (141 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 1 factoid took 495 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
[2024-05-28 05:04:56] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-28 05:04:56] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 p1 p2))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 411 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-08 finished in 2887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 37 transition count 51
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 30 transition count 44
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 30 transition count 44
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 24 transition count 38
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 24 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 24 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 21 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 21 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 21 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 21 transition count 29
Graph (complete) has 44 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 20 transition count 28
Applied a total of 50 rules in 11 ms. Remains 20 /57 variables (removed 37) and now considering 28/64 (removed 36) transitions.
[2024-05-28 05:04:57] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 20 cols
[2024-05-28 05:04:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:04:57] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 05:04:57] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-28 05:04:57] [INFO ] Invariant cache hit.
[2024-05-28 05:04:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 05:04:57] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-28 05:04:57] [INFO ] Redundant transitions in 16 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-28 05:04:57] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-28 05:04:57] [INFO ] Invariant cache hit.
[2024-05-28 05:04:57] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/41 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/44 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 132 ms.
Refiners :[State Equation: 19/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 21/39 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 49 constraints, problems are : Problem set: 0 solved, 17 unsolved in 183 ms.
Refiners :[State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/57 places, 28/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 20/57 places, 28/64 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-09 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 41 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 38 transition count 51
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 18 place count 30 transition count 43
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 30 transition count 43
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 22 transition count 35
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 22 transition count 35
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 22 transition count 32
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 18 transition count 28
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 18 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 18 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 18 transition count 21
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 40 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 14 transition count 19
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 13 transition count 18
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 70 place count 12 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 72 place count 12 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 75 place count 10 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 76 place count 10 transition count 12
Applied a total of 76 rules in 17 ms. Remains 10 /57 variables (removed 47) and now considering 12/64 (removed 52) transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-05-28 05:04:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:04:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 05:04:57] [INFO ] Invariant cache hit.
[2024-05-28 05:04:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 05:04:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-28 05:04:58] [INFO ] Redundant transitions in 11 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 05:04:58] [INFO ] Invariant cache hit.
[2024-05-28 05:04:58] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46 ms.
Refiners :[State Equation: 9/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/57 places, 12/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 10/57 places, 12/64 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 40 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 151 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 144 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-28 05:04:58] [INFO ] Invariant cache hit.
[2024-05-28 05:04:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 05:04:58] [INFO ] Invariant cache hit.
[2024-05-28 05:04:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 05:04:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 05:04:58] [INFO ] Redundant transitions in 11 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 05:04:58] [INFO ] Invariant cache hit.
[2024-05-28 05:04:58] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 50 ms.
Refiners :[State Equation: 9/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 10/10 places, 12/12 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 115 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 227 ms.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-28 05:04:59] [INFO ] Invariant cache hit.
[2024-05-28 05:04:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 05:04:59] [INFO ] Invariant cache hit.
[2024-05-28 05:05:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 05:05:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-28 05:05:00] [INFO ] Redundant transitions in 9 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 05:05:00] [INFO ] Invariant cache hit.
[2024-05-28 05:05:00] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/20 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 50 ms.
Refiners :[State Equation: 9/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 10/10 places, 12/12 transitions.
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-10 finished in 2241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(X(p0)) U ((!p0 U p1) U p2))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 44 transition count 55
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 36 transition count 47
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 36 transition count 47
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 28 transition count 39
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 28 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 28 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 26 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 26 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 26 transition count 32
Applied a total of 63 rules in 2 ms. Remains 26 /57 variables (removed 31) and now considering 32/64 (removed 32) transitions.
[2024-05-28 05:05:00] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2024-05-28 05:05:00] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:05:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 05:05:00] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 05:05:00] [INFO ] Invariant cache hit.
[2024-05-28 05:05:00] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 05:05:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-05-28 05:05:00] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 05:05:00] [INFO ] Invariant cache hit.
[2024-05-28 05:05:00] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/54 variables, and 43 constraints, problems are : Problem set: 0 solved, 26 unsolved in 230 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/54 variables, and 69 constraints, problems are : Problem set: 0 solved, 26 unsolved in 183 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 418ms
Starting structural reductions in LTL mode, iteration 1 : 26/57 places, 32/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 26/57 places, 32/64 transitions.
Stuttering acceptance computed with spot in 227 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 83 ms.
Product exploration explored 100000 steps with 2 reset in 100 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 453 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 1/10 properties
BEST_FIRST walk for 206 steps (0 resets) in 6 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 717 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 236 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 05:05:03] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 05:05:03] [INFO ] Invariant cache hit.
[2024-05-28 05:05:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 05:05:03] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 05:05:03] [INFO ] Invariant cache hit.
[2024-05-28 05:05:03] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 05:05:03] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-05-28 05:05:03] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 05:05:03] [INFO ] Invariant cache hit.
[2024-05-28 05:05:03] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/54 variables, and 43 constraints, problems are : Problem set: 0 solved, 26 unsolved in 206 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/54 variables, and 69 constraints, problems are : Problem set: 0 solved, 26 unsolved in 178 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/26 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 397ms
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 26/26 places, 32/32 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 486 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F p2), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 777 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 270 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 247 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-11 finished in 5862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p1))))))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 45 transition count 56
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 37 transition count 48
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 37 transition count 48
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 29 transition count 40
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 29 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 29 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 25 transition count 33
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 25 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 25 transition count 29
Applied a total of 67 rules in 6 ms. Remains 25 /57 variables (removed 32) and now considering 29/64 (removed 35) transitions.
[2024-05-28 05:05:06] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-05-28 05:05:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 05:05:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 05:05:06] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2024-05-28 05:05:06] [INFO ] Invariant cache hit.
[2024-05-28 05:05:06] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-28 05:05:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-05-28 05:05:06] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2024-05-28 05:05:06] [INFO ] Invariant cache hit.
[2024-05-28 05:05:06] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/52 variables, and 39 constraints, problems are : Problem set: 0 solved, 22 unsolved in 180 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/47 variables, 23/24 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/52 variables, and 61 constraints, problems are : Problem set: 0 solved, 22 unsolved in 163 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 348ms
Starting structural reductions in LTL mode, iteration 1 : 25/57 places, 29/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 25/57 places, 29/64 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-12 finished in 720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 37 transition count 52
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 17 place count 29 transition count 44
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 29 transition count 44
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 22 transition count 37
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 22 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 22 transition count 34
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 19 transition count 31
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 19 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 19 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 33 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 17 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 16 transition count 22
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 15 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 15 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 15 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 64 place count 14 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 65 place count 14 transition count 18
Applied a total of 65 rules in 12 ms. Remains 14 /57 variables (removed 43) and now considering 18/64 (removed 46) transitions.
Normalized transition count is 17 out of 18 initially.
// Phase 1: matrix 17 rows 14 cols
[2024-05-28 05:05:06] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:05:06] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 05:05:06] [INFO ] Invariant cache hit.
[2024-05-28 05:05:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 05:05:06] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 05:05:06] [INFO ] Redundant transitions in 19 ms returned [4]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 14 cols
[2024-05-28 05:05:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 05:05:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/26 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/31 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 106 ms.
Refiners :[State Equation: 12/14 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/24 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/26 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/27 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/31 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 123 ms.
Refiners :[State Equation: 13/14 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/57 places, 17/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 312 ms. Remains : 14/57 places, 17/64 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 38 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 215 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 36694 steps (8 resets) in 310 ms. (117 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 317 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-05-28 05:05:08] [INFO ] Invariant cache hit.
[2024-05-28 05:05:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 05:05:08] [INFO ] Invariant cache hit.
[2024-05-28 05:05:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 05:05:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 05:05:08] [INFO ] Redundant transitions in 18 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-28 05:05:08] [INFO ] Invariant cache hit.
[2024-05-28 05:05:08] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/26 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/31 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 79 ms.
Refiners :[State Equation: 12/14 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/20 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/24 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/26 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/27 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/28 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/31 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 88 ms.
Refiners :[State Equation: 13/14 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 170ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 14/14 places, 17/17 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 23398 steps (5 resets) in 31 ms. (731 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 6 factoid took 335 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 56 ms.
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-13 finished in 2680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p0&&X(p0)&&F(p1))||X(G(p0)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 43 transition count 54
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 37 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 37 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 31 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 31 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 30 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 30 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 30 transition count 37
Applied a total of 54 rules in 7 ms. Remains 30 /57 variables (removed 27) and now considering 37/64 (removed 27) transitions.
[2024-05-28 05:05:09] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 30 cols
[2024-05-28 05:05:09] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 05:05:09] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 05:05:09] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-28 05:05:09] [INFO ] Invariant cache hit.
[2024-05-28 05:05:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 05:05:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-28 05:05:09] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-28 05:05:09] [INFO ] Invariant cache hit.
[2024-05-28 05:05:09] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 31/61 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/62 variables, and 53 constraints, problems are : Problem set: 0 solved, 32 unsolved in 274 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 31/61 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 32/85 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/62 variables, and 85 constraints, problems are : Problem set: 0 solved, 32 unsolved in 233 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 513ms
Starting structural reductions in LTL mode, iteration 1 : 30/57 places, 37/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 30/57 places, 37/64 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-14
Stuttering criterion allowed to conclude after 97127 steps with 32825 reset in 188 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-14 finished in 966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(!p0)))&&((p1 U p2) U (p3||F(p4)))))'
Support contains 9 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 42 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 40 transition count 54
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 33 transition count 47
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 33 transition count 47
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 27 transition count 41
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 27 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 27 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 23 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 23 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 23 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 37 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 21 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 20 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 58 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 19 transition count 22
Applied a total of 60 rules in 11 ms. Remains 19 /57 variables (removed 38) and now considering 22/64 (removed 42) transitions.
// Phase 1: matrix 22 rows 19 cols
[2024-05-28 05:05:10] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 05:05:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 05:05:10] [INFO ] Invariant cache hit.
[2024-05-28 05:05:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 05:05:10] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 05:05:10] [INFO ] Redundant transitions in 12 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-28 05:05:10] [INFO ] Invariant cache hit.
[2024-05-28 05:05:10] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/26 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 4/30 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 4/34 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/41 variables, and 29 constraints, problems are : Problem set: 0 solved, 14 unsolved in 156 ms.
Refiners :[State Equation: 16/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/26 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 4/30 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 4/34 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/34 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/41 variables, and 43 constraints, problems are : Problem set: 0 solved, 14 unsolved in 113 ms.
Refiners :[State Equation: 16/19 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/57 places, 22/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 19/57 places, 22/64 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR p0 (AND (NOT p3) (NOT p4))), p0, (NOT p4), (AND (NOT p2) (NOT p4)), (AND (NOT p3) (NOT p4)), p0, true]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-15 finished in 656 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)))'
[2024-05-28 05:05:11] [INFO ] Flatten gal took : 7 ms
[2024-05-28 05:05:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-28 05:05:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 64 transitions and 232 arcs took 7 ms.
Total runtime 22082 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SemanticWebServices-PT-S064P09

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/409/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: 1714
MODEL NAME: /home/mcc/execution/409/model
57 places, 64 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.
Building monolithic NSF...
coverability test failed!!
Start RS construction.
Convergence in 1 steps.
The state space is infinite.
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716872711924

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SemanticWebServices-PT-S064P09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="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-S064P09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679078600499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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