Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 02:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 12 02:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 02:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 02:39 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 814K 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-S128P09-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S128P09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717228515144

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:55:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:55:16] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-06-01 07:55:16] [INFO ] Transformed 242 places.
[2024-06-01 07:55:16] [INFO ] Transformed 946 transitions.
[2024-06-01 07:55:16] [INFO ] Parsed PT model containing 242 places and 946 transitions and 6609 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 64 places in 4 ms
Reduce places removed 64 places and 534 transitions.
Ensure Unique test removed 212 transitions
Reduce redundant transitions removed 212 transitions.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 200/200 transitions.
Ensure Unique test removed 19 places
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 66 transition count 86
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 236 place count 56 transition count 73
Iterating global reduction 1 with 10 rules applied. Total rules applied 246 place count 56 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 250 place count 56 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 252 place count 54 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 54 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 256 place count 54 transition count 65
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 262 place count 51 transition count 62
Applied a total of 262 rules in 44 ms. Remains 51 /178 variables (removed 127) and now considering 62/200 (removed 138) transitions.
[2024-06-01 07:55:16] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 51 cols
[2024-06-01 07:55:16] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 07:55:17] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 07:55:17] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-06-01 07:55:17] [INFO ] Invariant cache hit.
[2024-06-01 07:55:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-01 07:55:17] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-01 07:55:17] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-06-01 07:55:17] [INFO ] Invariant cache hit.
[2024-06-01 07:55:17] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 39/78 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/104 variables, and 71 constraints, problems are : Problem set: 0 solved, 44 unsolved in 525 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 39/51 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 39/78 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/104 variables, and 115 constraints, problems are : Problem set: 0 solved, 44 unsolved in 394 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 39/51 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 954ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 964ms
Starting structural reductions in LTL mode, iteration 1 : 51/178 places, 62/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1294 ms. Remains : 51/178 places, 62/200 transitions.
Support contains 23 out of 51 places after structural reductions.
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 18 ms
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:55:18] [INFO ] Input system was already deterministic with 62 transitions.
RANDOM walk for 40000 steps (8 resets) in 1167 ms. (34 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:18] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 17/104 variables, and 9 constraints, problems are : Problem set: 2 solved, 0 unsolved in 27 ms.
Refiners :[Generalized P Invariants (flows): 1/2 constraints, State Equation: 8/51 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-14 TRUE 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' '!(F(p0))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Graph (complete) has 87 edges and 51 vertex of which 33 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 31 transition count 45
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 25 transition count 39
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 25 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 25 transition count 38
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 32 place count 20 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 37 place count 20 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 20 transition count 32
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 15 transition count 27
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 15 transition count 27
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 53 place count 15 transition count 22
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 55 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 28 edges and 14 vertex of which 13 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 4 with 2 rules applied. Total rules applied 57 place count 13 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 59 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 60 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 61 place count 11 transition count 16
Iterating global reduction 6 with 1 rules applied. Total rules applied 62 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 63 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 64 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 65 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 8 with 1 rules applied. Total rules applied 66 place count 10 transition count 13
Applied a total of 66 rules in 21 ms. Remains 10 /51 variables (removed 41) and now considering 13/62 (removed 49) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-06-01 07:55:19] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:55:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:55:19] [INFO ] Invariant cache hit.
[2024-06-01 07:55:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:55:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 07:55:19] [INFO ] Redundant transitions in 13 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 07:55:19] [INFO ] Invariant cache hit.
[2024-06-01 07:55:19] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/20 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/23 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[State Equation: 9/10 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/18 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/20 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/21 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/22 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 73 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/51 places, 13/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 10/51 places, 13/62 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-00 finished in 479 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 U X(X((p1||X(X(!p0)))))))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 40 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 36 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 36 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 36 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 34 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 34 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 34 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 33 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 33 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 33 transition count 41
Applied a total of 39 rules in 3 ms. Remains 33 /51 variables (removed 18) and now considering 41/62 (removed 21) transitions.
[2024-06-01 07:55:19] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
// Phase 1: matrix 35 rows 33 cols
[2024-06-01 07:55:19] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:55:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 07:55:19] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
[2024-06-01 07:55:19] [INFO ] Invariant cache hit.
[2024-06-01 07:55:19] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:55:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 34 sub problems to find dead transitions.
[2024-06-01 07:55:19] [INFO ] Flow matrix only has 35 transitions (discarded 6 similar events)
[2024-06-01 07:55:19] [INFO ] Invariant cache hit.
[2024-06-01 07:55:19] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 32/63 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/68 variables, and 55 constraints, problems are : Problem set: 0 solved, 34 unsolved in 290 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/33 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 32/63 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/68 variables, and 89 constraints, problems are : Problem set: 0 solved, 34 unsolved in 242 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/33 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 538ms
Starting structural reductions in LTL mode, iteration 1 : 33/51 places, 41/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 33/51 places, 41/62 transitions.
Stuttering acceptance computed with spot in 1256 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-01
Stuttering criterion allowed to conclude after 11 steps with 2 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-01 finished in 1894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 39 transition count 50
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 34 transition count 45
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 34 transition count 45
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 34 transition count 44
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 31 transition count 41
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 31 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 30 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 30 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 30 transition count 38
Applied a total of 45 rules in 5 ms. Remains 30 /51 variables (removed 21) and now considering 38/62 (removed 24) transitions.
[2024-06-01 07:55:21] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
// Phase 1: matrix 32 rows 30 cols
[2024-06-01 07:55:21] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:55:21] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-06-01 07:55:21] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2024-06-01 07:55:21] [INFO ] Invariant cache hit.
[2024-06-01 07:55:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 07:55:21] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 07:55:21] [INFO ] Flow matrix only has 32 transitions (discarded 6 similar events)
[2024-06-01 07:55:21] [INFO ] Invariant cache hit.
[2024-06-01 07:55:21] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 30/59 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/62 variables, and 51 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2661 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/30 constraints, ReadFeed: 21/21 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 30/59 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 32/83 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/62 variables, and 83 constraints, problems are : Problem set: 0 solved, 32 unsolved in 241 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/30 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 2907ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2908ms
Starting structural reductions in LTL mode, iteration 1 : 30/51 places, 38/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3452 ms. Remains : 30/51 places, 38/62 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-03 finished in 3620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F(p1)||G(p0))))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 40 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 36 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 36 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 36 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 34 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 34 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 33 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 33 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 33 transition count 42
Applied a total of 38 rules in 5 ms. Remains 33 /51 variables (removed 18) and now considering 42/62 (removed 20) transitions.
[2024-06-01 07:55:25] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
// Phase 1: matrix 35 rows 33 cols
[2024-06-01 07:55:25] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:55:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 07:55:25] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
[2024-06-01 07:55:25] [INFO ] Invariant cache hit.
[2024-06-01 07:55:25] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:55:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 35 sub problems to find dead transitions.
[2024-06-01 07:55:25] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
[2024-06-01 07:55:25] [INFO ] Invariant cache hit.
[2024-06-01 07:55:25] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 32/63 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/68 variables, and 55 constraints, problems are : Problem set: 0 solved, 35 unsolved in 321 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/33 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 32/63 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/68 variables, and 90 constraints, problems are : Problem set: 0 solved, 35 unsolved in 267 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/33 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 601ms
Starting structural reductions in LTL mode, iteration 1 : 33/51 places, 42/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 33/51 places, 42/62 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-05 finished in 946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Graph (complete) has 87 edges and 51 vertex of which 34 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 32 transition count 46
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 26 transition count 40
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 26 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 26 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 21 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 21 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 21 transition count 33
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 42 place count 16 transition count 28
Iterating global reduction 3 with 5 rules applied. Total rules applied 47 place count 16 transition count 28
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 52 place count 16 transition count 23
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 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 28 edges and 15 vertex of which 14 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 4 with 2 rules applied. Total rules applied 56 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 13 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 13 transition count 19
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 60 place count 11 transition count 17
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 11 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 64 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 65 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 66 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 7 with 1 rules applied. Total rules applied 67 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 68 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 8 with 1 rules applied. Total rules applied 69 place count 9 transition count 12
Applied a total of 69 rules in 15 ms. Remains 9 /51 variables (removed 42) and now considering 12/62 (removed 50) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-06-01 07:55:25] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:55:25] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 07:55:26] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:55:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 07:55:26] [INFO ] Redundant transitions in 14 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 07:55:26] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/21 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[State Equation: 7/9 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/18 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[State Equation: 8/9 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 108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/51 places, 12/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 9/51 places, 12/62 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-07 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Graph (complete) has 87 edges and 51 vertex of which 34 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 32 transition count 46
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 26 transition count 40
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 26 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 26 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 31 place count 21 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 36 place count 21 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 21 transition count 33
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 42 place count 16 transition count 28
Iterating global reduction 3 with 5 rules applied. Total rules applied 47 place count 16 transition count 28
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 52 place count 16 transition count 23
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 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 28 edges and 15 vertex of which 14 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 4 with 2 rules applied. Total rules applied 56 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 13 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 13 transition count 19
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 60 place count 11 transition count 17
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 11 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 64 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 65 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 66 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 7 with 1 rules applied. Total rules applied 67 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 68 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 8 with 1 rules applied. Total rules applied 69 place count 9 transition count 12
Applied a total of 69 rules in 12 ms. Remains 9 /51 variables (removed 42) and now considering 12/62 (removed 50) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-06-01 07:55:26] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:55:26] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 07:55:26] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:55:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 07:55:26] [INFO ] Redundant transitions in 13 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 07:55:26] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [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 44 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 47 ms.
Refiners :[State Equation: 8/9 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/51 places, 12/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 9/51 places, 12/62 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-09 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F(p1)))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Graph (complete) has 87 edges and 51 vertex of which 35 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 33 transition count 47
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 29 transition count 43
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 29 transition count 43
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 25 transition count 39
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 25 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 25 transition count 38
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 21 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 21 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 21 transition count 30
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 44 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 36 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 19 transition count 26
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 18 transition count 25
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 18 transition count 25
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 50 place count 16 transition count 23
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 16 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 54 place count 16 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 56 place count 15 transition count 20
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 58 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 59 place count 14 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 60 place count 14 transition count 17
Applied a total of 60 rules in 14 ms. Remains 14 /51 variables (removed 37) and now considering 17/62 (removed 45) transitions.
// Phase 1: matrix 17 rows 14 cols
[2024-06-01 07:55:26] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:55:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 07:55:26] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:55:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 07:55:26] [INFO ] Redundant transitions in 15 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 07:55:26] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/31 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 67 ms.
Refiners :[State Equation: 10/14 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/20 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/22 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/23 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/23 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/24 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/31 variables, and 25 constraints, problems are : Problem set: 0 solved, 7 unsolved in 84 ms.
Refiners :[State Equation: 11/14 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/51 places, 17/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 14/51 places, 17/62 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-10
Stuttering criterion allowed to conclude after 4029 steps with 1335 reset in 21 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-10 finished in 357 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 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Graph (complete) has 87 edges and 51 vertex of which 33 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 31 transition count 45
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 26 transition count 40
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 26 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 26 transition count 39
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 22 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 22 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 18 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 18 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 18 transition count 27
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 47 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 35 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 16 transition count 24
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 15 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 15 transition count 23
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 13 transition count 21
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 13 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 57 place count 13 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 59 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 60 place count 12 transition count 17
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 62 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 63 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 64 place count 11 transition count 14
Applied a total of 64 rules in 11 ms. Remains 11 /51 variables (removed 40) and now considering 14/62 (removed 48) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-06-01 07:55:26] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 07:55:26] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:55:26] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:55:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 07:55:26] [INFO ] Redundant transitions in 14 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 07:55:26] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/19 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/20 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/25 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[State Equation: 9/11 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/18 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/20 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/21 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/22 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/25 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 70 ms.
Refiners :[State Equation: 10/11 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/51 places, 14/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 11/51 places, 14/62 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-11 finished in 310 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(!p0))))))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 62/62 transitions.
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 40 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 35 transition count 46
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 35 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 35 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 32 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 32 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 31 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 31 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 31 transition count 39
Applied a total of 43 rules in 8 ms. Remains 31 /51 variables (removed 20) and now considering 39/62 (removed 23) transitions.
[2024-06-01 07:55:27] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 31 cols
[2024-06-01 07:55:27] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:55:27] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:55:27] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2024-06-01 07:55:27] [INFO ] Invariant cache hit.
[2024-06-01 07:55:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-01 07:55:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-06-01 07:55:27] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2024-06-01 07:55:27] [INFO ] Invariant cache hit.
[2024-06-01 07:55:27] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 30/59 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/64 variables, and 51 constraints, problems are : Problem set: 0 solved, 32 unsolved in 274 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/31 constraints, ReadFeed: 21/21 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 30/59 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 32/83 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/64 variables, and 83 constraints, problems are : Problem set: 0 solved, 32 unsolved in 219 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/31 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 504ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 505ms
Starting structural reductions in LTL mode, iteration 1 : 31/51 places, 39/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 31/51 places, 39/62 transitions.
Stuttering acceptance computed with spot in 157 ms :[false, p0, false, false]
Running random walk in product with property : SemanticWebServices-PT-S128P09-LTLCardinality-13
Stuttering criterion allowed to conclude after 77 steps with 4 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P09-LTLCardinality-13 finished in 747 ms.
All properties solved by simple procedures.
Total runtime 11528 ms.
ITS solved all properties within timeout

BK_STOP 1717228527916

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-S128P09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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