Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r184-tall-174889265100908.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-S128P15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889265100908
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 227K 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-S128P15-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S128P15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749250957980

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-S128P15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 23:02:39] [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 23:02:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 23:02:39] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-06 23:02:39] [INFO ] Transformed 188 places.
[2025-06-06 23:02:39] [INFO ] Transformed 416 transitions.
[2025-06-06 23:02:39] [INFO ] Parsed PT model containing 188 places and 416 transitions and 1593 arcs in 180 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 2 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 220 transitions
Reduce redundant transitions removed 220 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Ensure Unique test removed 32 places
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 206 rules applied. Total rules applied 206 place count 82 transition count 92
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 214 place count 74 transition count 84
Iterating global reduction 1 with 8 rules applied. Total rules applied 222 place count 74 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 223 place count 74 transition count 83
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 227 place count 70 transition count 79
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 70 transition count 79
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 234 place count 67 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 237 place count 67 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 239 place count 65 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 241 place count 65 transition count 74
Applied a total of 241 rules in 31 ms. Remains 65 /186 variables (removed 121) and now considering 74/194 (removed 120) transitions.
[2025-06-06 23:02:39] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
// Phase 1: matrix 65 rows 65 cols
[2025-06-06 23:02:39] [INFO ] Computed 3 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:39] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-06 23:02:39] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2025-06-06 23:02:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 23:02:39] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2025-06-06 23:02:39] [INFO ] Flow matrix only has 65 transitions (discarded 9 similar events)
[2025-06-06 23:02:39] [INFO ] Invariant cache hit.
[2025-06-06 23:02:39] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 64/129 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 55/123 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/130 variables, and 123 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1201 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 64/129 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 55/123 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 69/192 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/130 variables, and 192 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1321 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2544ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2553ms
Starting structural reductions in LTL mode, iteration 1 : 65/186 places, 74/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2886 ms. Remains : 65/186 places, 74/194 transitions.
Support contains 9 out of 65 places after structural reductions.
[2025-06-06 23:02:42] [INFO ] Flatten gal took : 18 ms
[2025-06-06 23:02:42] [INFO ] Flatten gal took : 7 ms
[2025-06-06 23:02:42] [INFO ] Input system was already deterministic with 74 transitions.
RANDOM walk for 20576 steps (5 resets) in 461 ms. (44 steps per ms) remains 0/7 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' '!(X((p0||X(((p1||X(X(p0))) U (p0&&(p1||X(X(p0)))))))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 61 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 60 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 59 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 59 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 58 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 58 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 57 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 57 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 56 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 56 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 56 transition count 65
Applied a total of 18 rules in 10 ms. Remains 56 /65 variables (removed 9) and now considering 65/74 (removed 9) transitions.
[2025-06-06 23:02:43] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
// Phase 1: matrix 57 rows 56 cols
[2025-06-06 23:02:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:43] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-06 23:02:43] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
[2025-06-06 23:02:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:43] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-06 23:02:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-06 23:02:43] [INFO ] Flow matrix only has 57 transitions (discarded 8 similar events)
[2025-06-06 23:02:43] [INFO ] Invariant cache hit.
[2025-06-06 23:02:43] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 56/112 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 47/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/113 variables, and 105 constraints, problems are : Problem set: 0 solved, 60 unsolved in 738 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 56/112 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 47/105 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 60/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/113 variables, and 165 constraints, problems are : Problem set: 0 solved, 60 unsolved in 922 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1668ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1668ms
Starting structural reductions in LTL mode, iteration 1 : 56/65 places, 65/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1754 ms. Remains : 56/65 places, 65/74 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-03 finished in 2110 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)) U p1))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 142 edges and 65 vertex of which 59 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 53 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 53 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 50 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 50 transition count 64
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 46 transition count 60
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 46 transition count 60
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 24 place count 43 transition count 57
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 43 transition count 57
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 30 place count 40 transition count 54
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 40 transition count 54
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 36 place count 37 transition count 51
Iterating global reduction 0 with 3 rules applied. Total rules applied 39 place count 37 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 37 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 37 transition count 46
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 76 edges and 36 vertex of which 35 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 1 with 2 rules applied. Total rules applied 46 place count 35 transition count 45
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 48 place count 35 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 34 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 33 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 33 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 32 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 32 transition count 41
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 30 transition count 39
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 30 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 28 transition count 37
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 28 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 28 transition count 35
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 64 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 66 place count 26 transition count 33
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 25 transition count 32
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 25 transition count 32
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 70 place count 24 transition count 31
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 24 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 24 transition count 30
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 74 place count 24 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 75 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 76 place count 22 transition count 27
Iterating global reduction 7 with 1 rules applied. Total rules applied 77 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 78 place count 21 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 79 place count 21 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 80 place count 21 transition count 25
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 81 place count 21 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 82 place count 20 transition count 24
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 83 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 84 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 85 place count 19 transition count 22
Applied a total of 85 rules in 59 ms. Remains 19 /65 variables (removed 46) and now considering 22/74 (removed 52) transitions.
// Phase 1: matrix 22 rows 19 cols
[2025-06-06 23:02:45] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:45] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-06 23:02:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-06 23:02:45] [INFO ] Implicit Places using invariants and state equation in 27 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 23:02:45] [INFO ] Redundant transitions in 15 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 23:02:45] [INFO ] Invariant cache hit.
[2025-06-06 23:02:45] [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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 17/32 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/34 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/36 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/38 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/41 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 317 ms.
Refiners :[State Equation: 18/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 17/32 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/34 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/36 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/38 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/39 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/39 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 1/40 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/40 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/40 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/41 variables, and 47 constraints, problems are : Problem set: 0 solved, 14 unsolved in 515 ms.
Refiners :[State Equation: 19/19 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 836ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 837ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/65 places, 22/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 968 ms. Remains : 19/65 places, 22/74 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-06 finished in 1080 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' '!(F(G(p0)))'
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 142 edges and 65 vertex of which 59 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 53 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 53 transition count 67
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 49 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 49 transition count 63
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 19 place count 45 transition count 59
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 45 transition count 59
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 27 place count 41 transition count 55
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 41 transition count 55
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 34 place count 38 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 37 place count 38 transition count 52
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 40 place count 35 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 43 place count 35 transition count 49
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 46 place count 35 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 35 transition count 44
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 72 edges and 34 vertex of which 33 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 1 with 2 rules applied. Total rules applied 50 place count 33 transition count 43
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 52 place count 33 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 31 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 30 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 30 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 28 transition count 37
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 28 transition count 37
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 25 transition count 34
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 25 transition count 34
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 25 transition count 31
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 71 place count 25 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 73 place count 23 transition count 29
Iterating global reduction 5 with 1 rules applied. Total rules applied 74 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 22 transition count 28
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 21 transition count 27
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 21 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 79 place count 21 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 81 place count 20 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 82 place count 19 transition count 24
Iterating global reduction 7 with 1 rules applied. Total rules applied 83 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 84 place count 18 transition count 23
Iterating global reduction 7 with 1 rules applied. Total rules applied 85 place count 18 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 86 place count 18 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 87 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 88 place count 17 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 89 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 90 place count 16 transition count 20
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 91 place count 16 transition count 19
Applied a total of 91 rules in 22 ms. Remains 16 /65 variables (removed 49) and now considering 19/74 (removed 55) transitions.
// Phase 1: matrix 19 rows 16 cols
[2025-06-06 23:02:46] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-06 23:02:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-06 23:02:46] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:02:46] [INFO ] Redundant transitions in 12 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:02:46] [INFO ] Invariant cache hit.
[2025-06-06 23:02:46] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/35 variables, and 27 constraints, problems are : Problem set: 0 solved, 12 unsolved in 185 ms.
Refiners :[State Equation: 15/16 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/33 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/34 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/35 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 219 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 413ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 414ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/65 places, 19/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 491 ms. Remains : 16/65 places, 19/74 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 160 ms.
Product exploration explored 100000 steps with 0 reset in 56 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 6714 steps (3 resets) in 34 ms. (191 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2025-06-06 23:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-06 23:02:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:02:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-06 23:02:47] [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.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:02:47] [INFO ] Redundant transitions in 13 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:02:47] [INFO ] Invariant cache hit.
[2025-06-06 23:02:47] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/35 variables, and 27 constraints, problems are : Problem set: 0 solved, 12 unsolved in 174 ms.
Refiners :[State Equation: 15/16 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/33 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/34 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/35 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 203 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 381ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 446 ms. Remains : 16/16 places, 19/19 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 16712 steps (5 resets) in 23 ms. (696 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 34 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Built C files in :
/tmp/ltsmin3140886115756117324
[2025-06-06 23:02:48] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2025-06-06 23:02:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:02:48] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2025-06-06 23:02:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:02:48] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2025-06-06 23:02:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:02:48] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3140886115756117324
Running compilation step : cd /tmp/ltsmin3140886115756117324;'/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 206 ms.
Running link step : cd /tmp/ltsmin3140886115756117324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3140886115756117324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11749995888108044638.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 19/19 transitions.
Applied a total of 0 rules in 3 ms. Remains 16 /16 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2025-06-06 23:03:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:03] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-06 23:03:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:03:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-06 23:03:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:03:03] [INFO ] Redundant transitions in 16 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-06 23:03:03] [INFO ] Invariant cache hit.
[2025-06-06 23:03:03] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/35 variables, and 27 constraints, problems are : Problem set: 0 solved, 12 unsolved in 172 ms.
Refiners :[State Equation: 15/16 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/28 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/33 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/34 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/35 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 223 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 398ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 467 ms. Remains : 16/16 places, 19/19 transitions.
Built C files in :
/tmp/ltsmin14181155042395023131
[2025-06-06 23:03:03] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2025-06-06 23:03:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:03:03] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2025-06-06 23:03:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:03:03] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2025-06-06 23:03:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:03:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14181155042395023131
Running compilation step : cd /tmp/ltsmin14181155042395023131;'/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 84 ms.
Running link step : cd /tmp/ltsmin14181155042395023131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14181155042395023131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12988918761600685665.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 23:03:18] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:03:18] [INFO ] Flatten gal took : 2 ms
[2025-06-06 23:03:18] [INFO ] Time to serialize gal into /tmp/LTL10038641144748004407.gal : 1 ms
[2025-06-06 23:03:18] [INFO ] Time to serialize properties into /tmp/LTL17040030817857572004.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10038641144748004407.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6324151095735392492.hoa' '-atoms' '/tmp/LTL17040030817857572004.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17040030817857572004.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6324151095735392492.hoa
Detected timeout of ITS tools.
[2025-06-06 23:03:33] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:03:33] [INFO ] Flatten gal took : 1 ms
[2025-06-06 23:03:33] [INFO ] Time to serialize gal into /tmp/LTL8441706515003517796.gal : 0 ms
[2025-06-06 23:03:33] [INFO ] Time to serialize properties into /tmp/LTL16342875566124399629.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8441706515003517796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16342875566124399629.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p141<1)"))))
Formula 0 simplified : GF!"(p141<1)"
Detected timeout of ITS tools.
[2025-06-06 23:03:49] [INFO ] Flatten gal took : 4 ms
[2025-06-06 23:03:49] [INFO ] Applying decomposition
[2025-06-06 23:03:49] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15219337561376955712.txt' '-o' '/tmp/graph15219337561376955712.bin' '-w' '/tmp/graph15219337561376955712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15219337561376955712.bin' '-l' '-1' '-v' '-w' '/tmp/graph15219337561376955712.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:03:49] [INFO ] Decomposing Gal with order
[2025-06-06 23:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:03:49] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-06 23:03:49] [INFO ] Flatten gal took : 32 ms
[2025-06-06 23:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2025-06-06 23:03:49] [INFO ] Time to serialize gal into /tmp/LTL14359708139371747331.gal : 1 ms
[2025-06-06 23:03:49] [INFO ] Time to serialize properties into /tmp/LTL16062895446131908461.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14359708139371747331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16062895446131908461.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i1.u3.p141<1)"))))
Formula 0 simplified : GF!"(i1.u3.p141<1)"
Detected timeout of ITS tools.
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-07 finished in 77990 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(p0))'
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 61 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 61 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 60 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 60 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 59 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 59 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 58 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 58 transition count 69
Applied a total of 12 rules in 3 ms. Remains 58 /65 variables (removed 7) and now considering 69/74 (removed 5) transitions.
[2025-06-06 23:04:04] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
// Phase 1: matrix 60 rows 58 cols
[2025-06-06 23:04:04] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 23:04:04] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2025-06-06 23:04:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-06 23:04:04] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-06 23:04:04] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2025-06-06 23:04:04] [INFO ] Invariant cache hit.
[2025-06-06 23:04:04] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 2/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 59/117 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/117 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 109 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1056 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 2/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 59/117 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 50/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 64/173 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 173 constraints, problems are : Problem set: 0 solved, 64 unsolved in 984 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2046ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2047ms
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 69/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2149 ms. Remains : 58/65 places, 69/74 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-11 finished in 2499 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' '!(F(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 142 edges and 65 vertex of which 59 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 53 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 53 transition count 66
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 49 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 49 transition count 62
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 22 place count 44 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 27 place count 44 transition count 57
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 31 place count 40 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 35 place count 40 transition count 53
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 38 place count 37 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 41 place count 37 transition count 50
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 44 place count 34 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 47 place count 34 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 50 place count 34 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 34 transition count 42
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 74 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 32 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 32 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 30 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 30 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 28 transition count 37
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 28 transition count 37
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 25 transition count 34
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 25 transition count 34
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 21 transition count 30
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 21 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 80 place count 21 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 20 transition count 25
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 83 place count 19 transition count 24
Iterating global reduction 5 with 1 rules applied. Total rules applied 84 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 85 place count 18 transition count 23
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 18 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 87 place count 17 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 17 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 17 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 90 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 16 transition count 20
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 92 place count 15 transition count 19
Iterating global reduction 7 with 1 rules applied. Total rules applied 93 place count 15 transition count 19
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 94 place count 14 transition count 18
Iterating global reduction 7 with 1 rules applied. Total rules applied 95 place count 14 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 96 place count 14 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 97 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 98 place count 13 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 99 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 100 place count 12 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 101 place count 12 transition count 14
Applied a total of 101 rules in 37 ms. Remains 12 /65 variables (removed 53) and now considering 14/74 (removed 60) transitions.
// Phase 1: matrix 14 rows 12 cols
[2025-06-06 23:04:06] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:06] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-06 23:04:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 23:04:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-06 23:04:06] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 23:04:06] [INFO ] Redundant transitions in 11 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-06 23:04:06] [INFO ] Invariant cache hit.
[2025-06-06 23:04:06] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 11/21 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/26 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 80 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 11/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 11/21 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/23 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/25 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 144 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/65 places, 14/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 341 ms. Remains : 12/65 places, 14/74 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P15-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P15-LTLFireability-15 finished in 383 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' '!(F(G(p0)))'
[2025-06-06 23:04:07] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17798522694782803421
[2025-06-06 23:04:07] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2025-06-06 23:04:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:04:07] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2025-06-06 23:04:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:04:07] [INFO ] Applying decomposition
[2025-06-06 23:04:07] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2025-06-06 23:04:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 23:04:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17798522694782803421
Running compilation step : cd /tmp/ltsmin17798522694782803421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-06-06 23:04:07] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph160007422283988594.txt' '-o' '/tmp/graph160007422283988594.bin' '-w' '/tmp/graph160007422283988594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph160007422283988594.bin' '-l' '-1' '-v' '-w' '/tmp/graph160007422283988594.weights' '-q' '0' '-e' '0.001'
[2025-06-06 23:04:07] [INFO ] Decomposing Gal with order
[2025-06-06 23:04:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 23:04:07] [INFO ] Removed a total of 16 redundant transitions.
[2025-06-06 23:04:07] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:04:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2025-06-06 23:04:07] [INFO ] Time to serialize gal into /tmp/LTLFireability8079761784203228744.gal : 1 ms
[2025-06-06 23:04:07] [INFO ] Time to serialize properties into /tmp/LTLFireability9945772890075344178.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8079761784203228744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9945772890075344178.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(i7.u6.p141<1)"))))
Formula 0 simplified : GF!"(i7.u6.p141<1)"
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin17798522694782803421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17798522694782803421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Initializing POR dependencies: labels 75, guards 74
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.018: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.018: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.045: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.094: There are 76 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.094: State length is 66, there are 78 groups
pins2lts-mc-linux64( 0/ 8), 0.094: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.094: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.094: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.094: Visible groups: 0 / 78, labels: 1 / 76
pins2lts-mc-linux64( 0/ 8), 0.094: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.094: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.164: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 7/ 8), 0.204: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 3/ 8), 0.296: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 0/ 8), 0.391: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 5/ 8), 0.631: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 5/ 8), 0.976: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 4/ 8), 1.507: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 5/ 8), 2.027: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 3/ 8), 3.057: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 3/ 8), 4.686: [Blue] ~61440 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 0/ 8), 7.259: [Blue] ~122880 levels ~983040 states ~983040 transitions
pins2lts-mc-linux64( 0/ 8), 11.148: [Blue] ~245760 levels ~1966080 states ~1966080 transitions
pins2lts-mc-linux64( 4/ 8), 18.837: [Blue] ~491520 levels ~3932160 states ~3932160 transitions
pins2lts-mc-linux64( 0/ 8), 27.401: [Blue] ~983040 levels ~7864320 states ~7864320 transitions
pins2lts-mc-linux64( 1/ 8), 46.172: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 46.445:
pins2lts-mc-linux64( 0/ 8), 46.445: Explored 12470377 states 12470402 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 46.445: Total exploration time 46.330 sec (46.040 sec minimum, 46.125 sec on average)
pins2lts-mc-linux64( 0/ 8), 46.445: States per second: 269164, Transitions per second: 269165
pins2lts-mc-linux64( 0/ 8), 46.445:
pins2lts-mc-linux64( 0/ 8), 46.445: State space has 6990608 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 46.445: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 46.445: blue states: 12470377 (178.39%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 46.445: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 46.445: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 46.445:
pins2lts-mc-linux64( 0/ 8), 46.445: Total memory used for local state coloring: 190.3MB
pins2lts-mc-linux64( 0/ 8), 46.445:
pins2lts-mc-linux64( 0/ 8), 46.445: Queue width: 8B, total height: 12470377, memory: 95.14MB
pins2lts-mc-linux64( 0/ 8), 46.445: Tree memory: 309.3MB, 46.4 B/state, compr.: 17.4%
pins2lts-mc-linux64( 0/ 8), 46.445: Tree fill ratio (roots/leafs): 5.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 46.445: Stored 75 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 46.445: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 46.445: Est. total memory use: 404.5MB (~1119.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17798522694782803421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17798522694782803421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-06 23:24:36] [INFO ] Flatten gal took : 5 ms
[2025-06-06 23:24:36] [INFO ] Time to serialize gal into /tmp/LTLFireability13394630207283151154.gal : 0 ms
[2025-06-06 23:24:36] [INFO ] Time to serialize properties into /tmp/LTLFireability8613866464126871110.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13394630207283151154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8613866464126871110.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(p141<1)"))))
Formula 0 simplified : GF!"(p141<1)"
Detected timeout of ITS tools.
[2025-06-06 23:45:06] [INFO ] Flatten gal took : 11 ms
[2025-06-06 23:45:06] [INFO ] Input system was already deterministic with 74 transitions.
[2025-06-06 23:45:06] [INFO ] Transformed 65 places.
[2025-06-06 23:45:06] [INFO ] Transformed 74 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-06 23:45:06] [INFO ] Time to serialize gal into /tmp/LTLFireability1279950997802435857.gal : 1 ms
[2025-06-06 23:45:06] [INFO ] Time to serialize properties into /tmp/LTLFireability2003830105022736177.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1279950997802435857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2003830105022736177.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(p141<1)"))))
Formula 0 simplified : GF!"(p141<1)"

BK_TIME_CONFINEMENT_REACHED

--------------------
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-S128P15"
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-S128P15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889265100908"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.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 ;