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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 02:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 12 02:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 02:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 02:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 814K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717228515255

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-S128P09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:55:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:55:16] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-06-01 07:55:16] [INFO ] Transformed 242 places.
[2024-06-01 07:55:16] [INFO ] Transformed 946 transitions.
[2024-06-01 07:55:16] [INFO ] Parsed PT model containing 242 places and 946 transitions and 6609 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 64 places in 4 ms
Reduce places removed 64 places and 534 transitions.
Ensure Unique test removed 212 transitions
Reduce redundant transitions removed 212 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 200/200 transitions.
Ensure Unique test removed 18 places
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 248 rules applied. Total rules applied 248 place count 56 transition count 74
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 259 place count 45 transition count 60
Iterating global reduction 1 with 11 rules applied. Total rules applied 270 place count 45 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 274 place count 45 transition count 56
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 279 place count 40 transition count 51
Iterating global reduction 2 with 5 rules applied. Total rules applied 284 place count 40 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 287 place count 37 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 290 place count 37 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 293 place count 37 transition count 45
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 295 place count 37 transition count 43
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 303 place count 33 transition count 39
Applied a total of 303 rules in 30 ms. Remains 33 /178 variables (removed 145) and now considering 39/200 (removed 161) transitions.
[2024-06-01 07:55:16] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
// Phase 1: matrix 33 rows 33 cols
[2024-06-01 07:55:16] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 07:55:16] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 07:55:16] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2024-06-01 07:55:16] [INFO ] Invariant cache hit.
[2024-06-01 07:55:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:55:17] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 34 sub problems to find dead transitions.
[2024-06-01 07:55:17] [INFO ] Flow matrix only has 33 transitions (discarded 6 similar events)
[2024-06-01 07:55:17] [INFO ] Invariant cache hit.
[2024-06-01 07:55:17] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 59 constraints, problems are : Problem set: 0 solved, 34 unsolved in 529 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 33/33 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 34/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 93 constraints, problems are : Problem set: 0 solved, 34 unsolved in 287 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 33/33 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 847ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 857ms
Starting structural reductions in LTL mode, iteration 1 : 33/178 places, 39/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1157 ms. Remains : 33/178 places, 39/200 transitions.
Support contains 7 out of 33 places after structural reductions.
[2024-06-01 07:55:18] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 19 ms
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P09-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:55:18] [INFO ] Input system was already deterministic with 39 transitions.
Support contains 4 out of 33 places (down from 7) after GAL structural reductions.
RANDOM walk for 16811 steps (4 resets) in 228 ms. (73 steps per ms) remains 0/2 properties
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:55:18] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 39/39 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 29 transition count 37
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 29 transition count 37
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 27 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 27 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 26 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 26 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 26 transition count 32
Applied a total of 14 rules in 5 ms. Remains 26 /33 variables (removed 7) and now considering 32/39 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 26/33 places, 32/39 transitions.
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:55:18] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 39/39 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 29 transition count 37
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 29 transition count 37
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 27 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 27 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 26 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 26 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 26 transition count 32
Applied a total of 14 rules in 4 ms. Remains 26 /33 variables (removed 7) and now considering 32/39 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 26/33 places, 32/39 transitions.
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:55:18] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 39/39 transitions.
Graph (complete) has 75 edges and 33 vertex of which 27 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 23 transition count 33
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 8 place count 20 transition count 30
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 20 transition count 29
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 17 transition count 26
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 17 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 17 transition count 23
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 24 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 30 edges and 16 vertex of which 15 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 26 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 3 with 1 rules applied. Total rules applied 27 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 14 transition count 18
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 13 transition count 17
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 13 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 31 place count 13 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 32 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 33 place count 12 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 34 place count 12 transition count 14
Applied a total of 34 rules in 19 ms. Remains 12 /33 variables (removed 21) and now considering 14/39 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 12/33 places, 14/39 transitions.
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 0 ms
[2024-06-01 07:55:18] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 39/39 transitions.
Graph (complete) has 75 edges and 33 vertex of which 27 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 23 transition count 33
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 8 place count 20 transition count 30
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 20 transition count 30
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 15 place count 16 transition count 26
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 16 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 23 place count 16 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 32 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 14 transition count 19
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 29 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 13 transition count 17
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 12 transition count 16
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 12 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 12 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 12 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 35 place count 11 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 11 transition count 13
Applied a total of 36 rules in 10 ms. Remains 11 /33 variables (removed 22) and now considering 13/39 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 11/33 places, 13/39 transitions.
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 1 ms
[2024-06-01 07:55:18] [INFO ] Input system was already deterministic with 13 transitions.
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:55:18] [INFO ] Flatten gal took : 2 ms
[2024-06-01 07:55:18] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2024-06-01 07:55:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 39 transitions and 119 arcs took 1 ms.
Total runtime 2067 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-S128P09-CTLFireability-2024-00
Could not compute solution for formula : SemanticWebServices-PT-S128P09-CTLFireability-2024-03
Could not compute solution for formula : SemanticWebServices-PT-S128P09-CTLFireability-2024-07
Could not compute solution for formula : SemanticWebServices-PT-S128P09-CTLFireability-2023-12

BK_STOP 1717228518717

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-S128P09-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/499/ctl_0_
ctl formula name SemanticWebServices-PT-S128P09-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/499/ctl_1_
ctl formula name SemanticWebServices-PT-S128P09-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/499/ctl_2_
ctl formula name SemanticWebServices-PT-S128P09-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/499/ctl_3_
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-S128P09"
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-S128P09, 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-171679080500538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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