Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Apr 12 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 224K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716850148118

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 22:49:09] [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]
[2024-05-27 22:49:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:49:09] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-27 22:49:09] [INFO ] Transformed 191 places.
[2024-05-27 22:49:09] [INFO ] Transformed 414 transitions.
[2024-05-27 22:49:09] [INFO ] Parsed PT model containing 191 places and 414 transitions and 1559 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 208 transitions
Reduce redundant transitions removed 208 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 204/204 transitions.
Ensure Unique test removed 31 places
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 69 transition count 80
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 253 place count 60 transition count 71
Iterating global reduction 1 with 9 rules applied. Total rules applied 262 place count 60 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 263 place count 60 transition count 70
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 269 place count 54 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 275 place count 54 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 279 place count 50 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 283 place count 50 transition count 60
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 285 place count 48 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 48 transition count 58
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 288 place count 47 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 289 place count 47 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 290 place count 47 transition count 56
Applied a total of 290 rules in 31 ms. Remains 47 /189 variables (removed 142) and now considering 56/204 (removed 148) transitions.
[2024-05-27 22:49:09] [INFO ] Flow matrix only has 48 transitions (discarded 8 similar events)
// Phase 1: matrix 48 rows 47 cols
[2024-05-27 22:49:09] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 22:49:09] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-27 22:49:09] [INFO ] Flow matrix only has 48 transitions (discarded 8 similar events)
[2024-05-27 22:49:09] [INFO ] Invariant cache hit.
[2024-05-27 22:49:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-27 22:49:09] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 51 sub problems to find dead transitions.
[2024-05-27 22:49:09] [INFO ] Flow matrix only has 48 transitions (discarded 8 similar events)
[2024-05-27 22:49:09] [INFO ] Invariant cache hit.
[2024-05-27 22:49:10] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 47/94 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 38/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/95 variables, and 87 constraints, problems are : Problem set: 0 solved, 51 unsolved in 624 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 47/94 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 38/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/95 variables, and 138 constraints, problems are : Problem set: 0 solved, 51 unsolved in 564 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1235ms
Starting structural reductions in LTL mode, iteration 1 : 47/189 places, 56/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1561 ms. Remains : 47/189 places, 56/204 transitions.
Support contains 6 out of 47 places after structural reductions.
[2024-05-27 22:49:11] [INFO ] Flatten gal took : 17 ms
[2024-05-27 22:49:11] [INFO ] Flatten gal took : 5 ms
[2024-05-27 22:49:11] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 4 out of 47 places (down from 6) after GAL structural reductions.
RANDOM walk for 16984 steps (5 resets) in 439 ms. (38 steps per ms) remains 0/4 properties
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 56/56 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 56
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 44 transition count 54
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 44 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 44 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 43 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 43 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 42 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 42 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 41 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 41 transition count 49
Applied a total of 13 rules in 6 ms. Remains 41 /47 variables (removed 6) and now considering 49/56 (removed 7) transitions.
[2024-05-27 22:49:11] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
// Phase 1: matrix 43 rows 41 cols
[2024-05-27 22:49:11] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 22:49:11] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-27 22:49:11] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
[2024-05-27 22:49:11] [INFO ] Invariant cache hit.
[2024-05-27 22:49:11] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-27 22:49:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 22:49:11] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
[2024-05-27 22:49:11] [INFO ] Invariant cache hit.
[2024-05-27 22:49:11] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 2/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 42/83 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 33/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/84 variables, and 75 constraints, problems are : Problem set: 0 solved, 44 unsolved in 463 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 2/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 42/83 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 33/75 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 44/119 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/84 variables, and 119 constraints, problems are : Problem set: 0 solved, 44 unsolved in 348 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 824ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 824ms
Starting structural reductions in LTL mode, iteration 1 : 41/47 places, 49/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 899 ms. Remains : 41/47 places, 49/56 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-00 finished in 1110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 56/56 transitions.
Graph (complete) has 102 edges and 47 vertex of which 41 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 35 transition count 48
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 35 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 35 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 32 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 32 transition count 44
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 30 transition count 42
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 30 transition count 42
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 28 transition count 40
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 28 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 28 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 28 transition count 37
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 58 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 26 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 25 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 25 transition count 35
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 23 transition count 33
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 20 transition count 30
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 20 transition count 30
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 16 transition count 26
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 16 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 53 place count 16 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 15 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 56 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 57 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 58 place count 13 transition count 19
Iterating global reduction 6 with 1 rules applied. Total rules applied 59 place count 13 transition count 19
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 60 place count 12 transition count 18
Iterating global reduction 6 with 1 rules applied. Total rules applied 61 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 62 place count 12 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 63 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 64 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 65 place count 10 transition count 15
Iterating global reduction 8 with 1 rules applied. Total rules applied 66 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 67 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 68 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 69 place count 9 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 70 place count 9 transition count 12
Applied a total of 70 rules in 27 ms. Remains 9 /47 variables (removed 38) and now considering 12/56 (removed 44) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-27 22:49:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 22:49:12] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-27 22:49:12] [INFO ] Invariant cache hit.
[2024-05-27 22:49:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-27 22:49:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-27 22:49:12] [INFO ] Redundant transitions in 13 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-27 22:49:12] [INFO ] Invariant cache hit.
[2024-05-27 22:49:12] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/21 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[State Equation: 8/9 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/18 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/20 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/47 places, 12/56 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 9/47 places, 12/56 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-05 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 56/56 transitions.
Graph (complete) has 102 edges and 47 vertex of which 41 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 36 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 36 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 36 transition count 48
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 34 transition count 46
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 34 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 33 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 33 transition count 45
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 31 transition count 43
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 31 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 30 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 30 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 30 transition count 41
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 23 place count 30 transition count 39
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 61 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 28 transition count 38
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 27 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 27 transition count 37
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 25 transition count 35
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 25 transition count 35
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 23 transition count 33
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 20 transition count 30
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 20 transition count 30
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 44 place count 20 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 47 place count 19 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 19 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 49 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 50 place count 17 transition count 23
Iterating global reduction 6 with 1 rules applied. Total rules applied 51 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 52 place count 16 transition count 22
Iterating global reduction 6 with 1 rules applied. Total rules applied 53 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 54 place count 16 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 55 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 56 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 57 place count 14 transition count 19
Iterating global reduction 8 with 1 rules applied. Total rules applied 58 place count 14 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 59 place count 14 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 60 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 61 place count 13 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 62 place count 13 transition count 16
Applied a total of 62 rules in 38 ms. Remains 13 /47 variables (removed 34) and now considering 16/56 (removed 40) transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-05-27 22:49:13] [INFO ] Computed 0 invariants in 1 ms
[2024-05-27 22:49:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-27 22:49:13] [INFO ] Invariant cache hit.
[2024-05-27 22:49:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-27 22:49:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-27 22:49:13] [INFO ] Redundant transitions in 15 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-27 22:49:13] [INFO ] Invariant cache hit.
[2024-05-27 22:49:13] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/22 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/26 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/29 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 100 ms.
Refiners :[State Equation: 12/13 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/22 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/24 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/26 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/27 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/27 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/28 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/28 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/28 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 31 constraints, problems are : Problem set: 0 solved, 9 unsolved in 103 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/47 places, 16/56 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 13/47 places, 16/56 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-08 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 56/56 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 56
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 43 transition count 53
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 43 transition count 52
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 41 transition count 50
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 41 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 40 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 40 transition count 49
Applied a total of 14 rules in 6 ms. Remains 40 /47 variables (removed 7) and now considering 49/56 (removed 7) transitions.
[2024-05-27 22:49:13] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 40 cols
[2024-05-27 22:49:13] [INFO ] Computed 1 invariants in 2 ms
[2024-05-27 22:49:13] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-27 22:49:13] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
[2024-05-27 22:49:13] [INFO ] Invariant cache hit.
[2024-05-27 22:49:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-27 22:49:13] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 22:49:13] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
[2024-05-27 22:49:13] [INFO ] Invariant cache hit.
[2024-05-27 22:49:13] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 41/81 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/81 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/82 variables, and 73 constraints, problems are : Problem set: 0 solved, 44 unsolved in 458 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 41/81 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 44/117 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/82 variables, and 117 constraints, problems are : Problem set: 0 solved, 44 unsolved in 345 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 816ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 817ms
Starting structural reductions in LTL mode, iteration 1 : 40/47 places, 49/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 893 ms. Remains : 40/47 places, 49/56 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-11 finished in 981 ms.
All properties solved by simple procedures.
Total runtime 5162 ms.

BK_STOP 1716850154550

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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