Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r184-tall-174889265100900.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SemanticWebServices-PT-S128P12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889265100900
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 224K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749247220052

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 22:00:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 22:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:00:21] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-06 22:00:21] [INFO ] Transformed 191 places.
[2025-06-06 22:00:21] [INFO ] Transformed 414 transitions.
[2025-06-06 22:00:21] [INFO ] Parsed PT model containing 191 places and 414 transitions and 1559 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 208 transitions
Reduce redundant transitions removed 208 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 204/204 transitions.
Ensure Unique test removed 28 places
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 72 transition count 80
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 248 place count 65 transition count 73
Iterating global reduction 1 with 7 rules applied. Total rules applied 255 place count 65 transition count 73
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 261 place count 59 transition count 67
Iterating global reduction 1 with 6 rules applied. Total rules applied 267 place count 59 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 272 place count 54 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 277 place count 54 transition count 62
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 279 place count 52 transition count 60
Iterating global reduction 1 with 2 rules applied. Total rules applied 281 place count 52 transition count 60
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 283 place count 50 transition count 58
Iterating global reduction 1 with 2 rules applied. Total rules applied 285 place count 50 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 287 place count 50 transition count 56
Applied a total of 287 rules in 30 ms. Remains 50 /189 variables (removed 139) and now considering 56/204 (removed 148) transitions.
[2025-06-06 22:00:21] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 50 cols
[2025-06-06 22:00:21] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:21] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-06 22:00:21] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 22:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-06 22:00:21] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2025-06-06 22:00:21] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2025-06-06 22:00:21] [INFO ] Invariant cache hit.
[2025-06-06 22:00:21] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 48/98 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/99 variables, and 93 constraints, problems are : Problem set: 0 solved, 50 unsolved in 831 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 48/98 variables, 50/55 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 50/143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/99 variables, and 143 constraints, problems are : Problem set: 0 solved, 50 unsolved in 929 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1783ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1791ms
Starting structural reductions in LTL mode, iteration 1 : 50/189 places, 56/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2097 ms. Remains : 50/189 places, 56/204 transitions.
Support contains 14 out of 50 places after structural reductions.
[2025-06-06 22:00:23] [INFO ] Flatten gal took : 17 ms
[2025-06-06 22:00:23] [INFO ] Flatten gal took : 6 ms
[2025-06-06 22:00:23] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 36849 steps (9 resets) in 807 ms. (45 steps per ms) remains 0/8 properties
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(X(p1))))) U G(p2)))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 56/56 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 56
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 45 transition count 54
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 45 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 45 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 44 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 44 transition count 52
Applied a total of 10 rules in 4 ms. Remains 44 /50 variables (removed 6) and now considering 52/56 (removed 4) transitions.
[2025-06-06 22:00:24] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
// Phase 1: matrix 45 rows 44 cols
[2025-06-06 22:00:24] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 22:00:24] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2025-06-06 22:00:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:24] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-06 22:00:24] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2025-06-06 22:00:24] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2025-06-06 22:00:24] [INFO ] Invariant cache hit.
[2025-06-06 22:00:24] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 81 constraints, problems are : Problem set: 0 solved, 47 unsolved in 581 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 44/88 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 35/81 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 47/128 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 128 constraints, problems are : Problem set: 0 solved, 47 unsolved in 700 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1288ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1290ms
Starting structural reductions in LTL mode, iteration 1 : 44/50 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1366 ms. Remains : 44/50 places, 52/56 transitions.
Stuttering acceptance computed with spot in 1092 ms :[(NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 212 ms.
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-00 finished in 2953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 56/56 transitions.
Graph (complete) has 124 edges and 50 vertex of which 44 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 35 transition count 47
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 35 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 46
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 31 transition count 42
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 31 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 31 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 30 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 30 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 29 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 29 transition count 39
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 27 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 65 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 27 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 26 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 26 transition count 35
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 24 transition count 33
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 24 transition count 33
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 21 transition count 30
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 21 transition count 30
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 17 transition count 26
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 17 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 53 place count 17 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 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 56 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 57 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 58 place count 14 transition count 19
Iterating global reduction 6 with 1 rules applied. Total rules applied 59 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 60 place count 13 transition count 18
Iterating global reduction 6 with 1 rules applied. Total rules applied 61 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 62 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 63 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 64 place count 12 transition count 16
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 65 place count 11 transition count 15
Iterating global reduction 8 with 1 rules applied. Total rules applied 66 place count 11 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 67 place count 11 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 68 place count 11 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 69 place count 10 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 70 place count 10 transition count 12
Applied a total of 70 rules in 26 ms. Remains 10 /50 variables (removed 40) and now considering 12/56 (removed 44) transitions.
// Phase 1: matrix 12 rows 10 cols
[2025-06-06 22:00:27] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-06 22:00:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-06 22:00:27] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:00:27] [INFO ] Redundant transitions in 12 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-06 22:00:27] [INFO ] Invariant cache hit.
[2025-06-06 22:00:27] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/22 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/10 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/19 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/20 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/21 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/21 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/21 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 23 constraints, problems are : Problem set: 0 solved, 6 unsolved in 106 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 191ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/50 places, 12/56 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 10/50 places, 12/56 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-09 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(F(p0)) U G(p1)))))))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 56/56 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 46 transition count 56
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 42 transition count 52
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 42 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 42 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 39 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 39 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 39 transition count 47
Applied a total of 20 rules in 6 ms. Remains 39 /50 variables (removed 11) and now considering 47/56 (removed 9) transitions.
[2025-06-06 22:00:27] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 39 cols
[2025-06-06 22:00:27] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:00:27] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2025-06-06 22:00:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:27] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-06 22:00:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2025-06-06 22:00:27] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2025-06-06 22:00:27] [INFO ] Invariant cache hit.
[2025-06-06 22:00:27] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 71 constraints, problems are : Problem set: 0 solved, 42 unsolved in 484 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 40/79 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 42/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 113 constraints, problems are : Problem set: 0 solved, 42 unsolved in 553 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1042ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1042ms
Starting structural reductions in LTL mode, iteration 1 : 39/50 places, 47/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1112 ms. Remains : 39/50 places, 47/56 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 155 ms.
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-10 finished in 1540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p1)))||p0)))'
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 56/56 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 56
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 47 transition count 54
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 47 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 46 transition count 53
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 46 transition count 53
Applied a total of 7 rules in 3 ms. Remains 46 /50 variables (removed 4) and now considering 53/56 (removed 3) transitions.
[2025-06-06 22:00:29] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
// Phase 1: matrix 46 rows 46 cols
[2025-06-06 22:00:29] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 22:00:29] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2025-06-06 22:00:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:29] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-06 22:00:29] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2025-06-06 22:00:29] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2025-06-06 22:00:29] [INFO ] Invariant cache hit.
[2025-06-06 22:00:29] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 45/91 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/92 variables, and 85 constraints, problems are : Problem set: 0 solved, 47 unsolved in 660 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 45/91 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 47/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/92 variables, and 132 constraints, problems are : Problem set: 0 solved, 47 unsolved in 668 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1334ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1335ms
Starting structural reductions in LTL mode, iteration 1 : 46/50 places, 53/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1473 ms. Remains : 46/50 places, 53/56 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
Computed a total of 9 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 16843 steps (4 resets) in 81 ms. (205 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2025-06-06 22:00:31] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2025-06-06 22:00:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 22:00:31] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2025-06-06 22:00:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:00:31] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-06 22:00:31] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2025-06-06 22:00:31] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2025-06-06 22:00:31] [INFO ] Invariant cache hit.
[2025-06-06 22:00:31] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 45/91 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/92 variables, and 85 constraints, problems are : Problem set: 0 solved, 47 unsolved in 528 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 45/91 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 47/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/92 variables, and 132 constraints, problems are : Problem set: 0 solved, 47 unsolved in 617 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 46/46 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1150ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1150ms
Finished structural reductions in LTL mode , in 1 iterations and 1215 ms. Remains : 46/46 places, 53/53 transitions.
Computed a total of 9 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 23541 steps (5 resets) in 54 ms. (428 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 53/53 transitions.
Graph (complete) has 112 edges and 46 vertex of which 40 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 39 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 38 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 38 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 37 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 37 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 36 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 36 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 36 transition count 43
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 81 edges and 35 vertex of which 34 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 0 with 2 rules applied. Total rules applied 14 place count 34 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 33 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 33 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 32 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 32 transition count 40
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 30 transition count 38
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 30 transition count 38
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 27 transition count 35
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 27 transition count 35
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 27 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 27 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 26 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 25 transition count 30
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 24 transition count 29
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 23 transition count 28
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 23 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 23 transition count 27
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 41 place count 23 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 42 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 43 place count 21 transition count 25
Iterating global reduction 6 with 1 rules applied. Total rules applied 44 place count 21 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 45 place count 21 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 47 place count 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 48 place count 20 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 49 place count 20 transition count 21
Applied a total of 49 rules in 22 ms. Remains 20 /46 variables (removed 26) and now considering 21/53 (removed 32) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:00:34] [INFO ] Redundant transitions in 13 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 20 cols
[2025-06-06 22:00:34] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 22:00:34] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 17/31 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3/34 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/36 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 4/40 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/41 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 228 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 17/31 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 3/34 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 2/36 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 4/40 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/40 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/40 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/41 variables, and 52 constraints, problems are : Problem set: 0 solved, 15 unsolved in 241 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 472ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 472ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/46 places, 21/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 511 ms. Remains : 20/46 places, 21/53 transitions.
Built C files in :
/tmp/ltsmin14253740797319406097
[2025-06-06 22:00:34] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14253740797319406097
Running compilation step : cd /tmp/ltsmin14253740797319406097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin14253740797319406097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14253740797319406097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased392122487208439232.hoa' '--buchi-type=spotba'
LTSmin run took 10511 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-11 finished in 16574 ms.
All properties solved by simple procedures.
Total runtime 24461 ms.

BK_STOP 1749247245740

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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