Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 9.0K Apr 12 02:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 02:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 02:48 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 227K 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-S128P15-CTLFireability-2024-00
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-01
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-02
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-03
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-04
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-05
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-06
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-07
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-08
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-09
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-10
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2024-11
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2023-12
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2023-13
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2023-14
FORMULA_NAME SemanticWebServices-PT-S128P15-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717228563157

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:56:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:56:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:56:04] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 07:56:04] [INFO ] Transformed 188 places.
[2024-06-01 07:56:04] [INFO ] Transformed 416 transitions.
[2024-06-01 07:56:04] [INFO ] Parsed PT model containing 188 places and 416 transitions and 1593 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
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 2 formulas.
FORMULA SemanticWebServices-PT-S128P15-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 30 places
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 84 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 209 place count 79 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 214 place count 79 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 217 place count 76 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 220 place count 76 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 221 place count 75 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 222 place count 75 transition count 83
Applied a total of 222 rules in 31 ms. Remains 75 /186 variables (removed 111) and now considering 83/194 (removed 111) transitions.
[2024-06-01 07:56:04] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
// Phase 1: matrix 74 rows 75 cols
[2024-06-01 07:56:04] [INFO ] Computed 5 invariants in 8 ms
[2024-06-01 07:56:04] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 07:56:04] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-06-01 07:56:04] [INFO ] Invariant cache hit.
[2024-06-01 07:56:04] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 07:56:04] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-06-01 07:56:04] [INFO ] Flow matrix only has 74 transitions (discarded 9 similar events)
[2024-06-01 07:56:04] [INFO ] Invariant cache hit.
[2024-06-01 07:56:04] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 73/148 variables, 75/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/149 variables, and 143 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1323 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 73/148 variables, 75/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 77/220 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/149 variables, and 220 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1571 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2955ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2967ms
Starting structural reductions in LTL mode, iteration 1 : 75/186 places, 83/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3303 ms. Remains : 75/186 places, 83/194 transitions.
Support contains 21 out of 75 places after structural reductions.
[2024-06-01 07:56:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 27 ms
[2024-06-01 07:56:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P15-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P15-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 83 transitions.
Support contains 16 out of 75 places (down from 21) after GAL structural reductions.
FORMULA SemanticWebServices-PT-S128P15-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 33560 steps (7 resets) in 1023 ms. (32 steps per ms) remains 0/12 properties
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 72 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 67 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 67 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 67 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 65 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 65 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 63 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 63 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 62 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 62 transition count 72
Applied a total of 24 rules in 8 ms. Remains 62 /75 variables (removed 13) and now considering 72/83 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 62/75 places, 72/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Graph (complete) has 175 edges and 75 vertex of which 69 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 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 57 transition count 72
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 57 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 57 transition count 71
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 51 transition count 65
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 51 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 46 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 46 transition count 60
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 40 transition count 54
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 40 transition count 54
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 37 transition count 51
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 37 transition count 51
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 34 transition count 48
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 34 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 34 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 67 place count 34 transition count 43
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 71 edges and 33 vertex of which 32 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 69 place count 32 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 32 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 31 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 30 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 30 transition count 40
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 75 place count 28 transition count 38
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 28 transition count 38
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 80 place count 25 transition count 35
Iterating global reduction 4 with 3 rules applied. Total rules applied 83 place count 25 transition count 35
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 87 place count 21 transition count 31
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 21 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 95 place count 21 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 20 transition count 25
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 99 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 100 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 101 place count 18 transition count 23
Iterating global reduction 7 with 1 rules applied. Total rules applied 102 place count 18 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 103 place count 17 transition count 22
Iterating global reduction 7 with 1 rules applied. Total rules applied 104 place count 17 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 105 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 8 with 1 rules applied. Total rules applied 106 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 107 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 9 with 1 rules applied. Total rules applied 108 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 109 place count 15 transition count 19
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 110 place count 15 transition count 18
Applied a total of 110 rules in 49 ms. Remains 15 /75 variables (removed 60) and now considering 18/83 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 15/75 places, 18/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 65 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 65 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 61 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 61 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 57 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 57 transition count 68
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 52 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 52 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 50 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 50 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 49 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 49 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 49 transition count 59
Applied a total of 50 rules in 19 ms. Remains 49 /75 variables (removed 26) and now considering 59/83 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 49/75 places, 59/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 65 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 65 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 61 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 61 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 57 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 57 transition count 68
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 52 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 52 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 50 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 50 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 49 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 49 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 49 transition count 59
Applied a total of 50 rules in 16 ms. Remains 49 /75 variables (removed 26) and now considering 59/83 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 49/75 places, 59/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 72 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 67 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 67 transition count 78
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 63 transition count 74
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 63 transition count 74
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 59 transition count 70
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 59 transition count 70
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 54 transition count 65
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 54 transition count 65
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 52 transition count 63
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 52 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 51 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 51 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 51 transition count 61
Applied a total of 46 rules in 6 ms. Remains 51 /75 variables (removed 24) and now considering 61/83 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 51/75 places, 61/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Graph (complete) has 175 edges and 75 vertex of which 69 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 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 58 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 58 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 58 transition count 72
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 53 transition count 67
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 53 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 48 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 48 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 43 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 43 transition count 57
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 40 transition count 54
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 40 transition count 54
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 38 transition count 52
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 38 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 38 transition count 50
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 58 place count 38 transition count 48
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 79 edges and 37 vertex of which 36 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 60 place count 36 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 36 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 35 transition count 45
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 34 transition count 44
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 34 transition count 44
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 32 transition count 42
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 32 transition count 42
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 72 place count 29 transition count 39
Iterating global reduction 4 with 3 rules applied. Total rules applied 75 place count 29 transition count 39
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 79 place count 25 transition count 35
Iterating global reduction 4 with 4 rules applied. Total rules applied 83 place count 25 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 87 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 5 with 1 rules applied. Total rules applied 88 place count 25 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 90 place count 23 transition count 29
Iterating global reduction 6 with 1 rules applied. Total rules applied 91 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 92 place count 22 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 94 place count 21 transition count 27
Iterating global reduction 6 with 1 rules applied. Total rules applied 95 place count 21 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 96 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 7 with 1 rules applied. Total rules applied 97 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 98 place count 20 transition count 25
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 99 place count 19 transition count 24
Iterating global reduction 8 with 1 rules applied. Total rules applied 100 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 101 place count 18 transition count 23
Iterating global reduction 8 with 1 rules applied. Total rules applied 102 place count 18 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 103 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 9 with 1 rules applied. Total rules applied 104 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 105 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 10 with 1 rules applied. Total rules applied 106 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 107 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 11 with 1 rules applied. Total rules applied 108 place count 16 transition count 19
Applied a total of 108 rules in 33 ms. Remains 16 /75 variables (removed 59) and now considering 19/83 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 16/75 places, 19/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 19 transitions.
RANDOM walk for 137 steps (1 resets) in 12 ms. (10 steps per ms) remains 0/1 properties
FORMULA SemanticWebServices-PT-S128P15-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 65 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 65 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 61 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 61 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 57 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 57 transition count 68
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 52 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 52 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 50 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 50 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 49 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 49 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 49 transition count 59
Applied a total of 50 rules in 5 ms. Remains 49 /75 variables (removed 26) and now considering 59/83 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/75 places, 59/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Graph (complete) has 175 edges and 75 vertex of which 69 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 59 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 59 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 59 transition count 72
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 54 transition count 67
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 54 transition count 67
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 49 transition count 62
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 49 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 44 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 44 transition count 57
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 42 transition count 55
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 42 transition count 55
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 40 transition count 53
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 40 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 40 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 40 transition count 48
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 85 edges and 39 vertex of which 38 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 59 place count 38 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 38 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 37 transition count 46
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 36 transition count 45
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 36 transition count 45
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 34 transition count 43
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 34 transition count 43
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 69 place count 32 transition count 41
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 32 transition count 41
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 29 transition count 38
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 29 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 80 place count 29 transition count 35
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 81 place count 29 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 27 transition count 33
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 27 transition count 33
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 85 place count 26 transition count 32
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 87 place count 25 transition count 31
Iterating global reduction 6 with 1 rules applied. Total rules applied 88 place count 25 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 89 place count 25 transition count 30
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 90 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 91 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 92 place count 23 transition count 28
Iterating global reduction 8 with 1 rules applied. Total rules applied 93 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 94 place count 22 transition count 27
Iterating global reduction 8 with 1 rules applied. Total rules applied 95 place count 22 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 96 place count 22 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 98 place count 22 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 99 place count 21 transition count 24
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 100 place count 21 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 101 place count 20 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 102 place count 20 transition count 22
Applied a total of 102 rules in 43 ms. Remains 20 /75 variables (removed 55) and now considering 22/83 (removed 61) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 20/75 places, 22/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 83/83 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 71 transition count 83
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 65 transition count 77
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 65 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 61 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 61 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 57 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 57 transition count 68
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 52 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 52 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 50 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 50 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 49 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 49 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 49 transition count 59
Applied a total of 50 rules in 25 ms. Remains 49 /75 variables (removed 26) and now considering 59/83 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 49/75 places, 59/83 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:56:08] [INFO ] Input system was already deterministic with 59 transitions.
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:56:08] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:56:08] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2024-06-01 07:56:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 83 transitions and 264 arcs took 10 ms.
Total runtime 4672 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SemanticWebServices-PT-S128P15-CTLFireability-2024-00
Could not compute solution for formula : SemanticWebServices-PT-S128P15-CTLFireability-2024-03
Could not compute solution for formula : SemanticWebServices-PT-S128P15-CTLFireability-2024-07
Could not compute solution for formula : SemanticWebServices-PT-S128P15-CTLFireability-2024-10
Could not compute solution for formula : SemanticWebServices-PT-S128P15-CTLFireability-2024-11
Could not compute solution for formula : SemanticWebServices-PT-S128P15-CTLFireability-2023-13
Could not compute solution for formula : SemanticWebServices-PT-S128P15-CTLFireability-2023-14
Could not compute solution for formula : SemanticWebServices-PT-S128P15-CTLFireability-2023-15

BK_STOP 1717228569325

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name SemanticWebServices-PT-S128P15-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/503/ctl_0_
ctl formula name SemanticWebServices-PT-S128P15-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/503/ctl_1_
ctl formula name SemanticWebServices-PT-S128P15-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/503/ctl_2_
ctl formula name SemanticWebServices-PT-S128P15-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/503/ctl_3_
ctl formula name SemanticWebServices-PT-S128P15-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/503/ctl_4_
ctl formula name SemanticWebServices-PT-S128P15-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/503/ctl_5_
ctl formula name SemanticWebServices-PT-S128P15-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/503/ctl_6_
ctl formula name SemanticWebServices-PT-S128P15-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/503/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SemanticWebServices-PT-S128P15, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679080600554"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;