About the Execution of LTSMin+red for CloudOpsManagement-PT-05120by02560
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
890.180 | 91341.00 | 193468.00 | 256.20 | ?T??FF?????????F | normal |
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.r480-tall-171624188600089.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 CloudOpsManagement-PT-05120by02560, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188600089
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:42 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 CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-00
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-01
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-02
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-03
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-04
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-05
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-06
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-07
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-08
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-09
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-10
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-11
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2023-12
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2023-13
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2023-14
FORMULA_NAME CloudOpsManagement-PT-05120by02560-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717178459813
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudOpsManagement-PT-05120by02560
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:01:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:01:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:01:01] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-31 18:01:01] [INFO ] Transformed 27 places.
[2024-05-31 18:01:01] [INFO ] Transformed 29 transitions.
[2024-05-31 18:01:01] [INFO ] Parsed PT model containing 27 places and 29 transitions and 94 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 9 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
// Phase 1: matrix 29 rows 27 cols
[2024-05-31 18:01:01] [INFO ] Computed 11 invariants in 6 ms
[2024-05-31 18:01:01] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-31 18:01:01] [INFO ] Invariant cache hit.
[2024-05-31 18:01:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 18:01:01] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 26 sub problems to find dead transitions.
[2024-05-31 18:01:01] [INFO ] Invariant cache hit.
[2024-05-31 18:01:01] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 3/27 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 28/55 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/56 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 41 constraints, problems are : Problem set: 0 solved, 26 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 3/27 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 28/55 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 67 constraints, problems are : Problem set: 0 solved, 26 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 839ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 850ms
Finished structural reductions in LTL mode , in 1 iterations and 1144 ms. Remains : 27/27 places, 29/29 transitions.
Support contains 27 out of 27 places after structural reductions.
[2024-05-31 18:01:02] [INFO ] Flatten gal took : 20 ms
[2024-05-31 18:01:02] [INFO ] Flatten gal took : 6 ms
[2024-05-31 18:01:02] [INFO ] Input system was already deterministic with 29 transitions.
RANDOM walk for 40984 steps (8 resets) in 91 ms. (445 steps per ms) remains 60/88 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 55/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
[2024-05-31 18:01:03] [INFO ] Invariant cache hit.
[2024-05-31 18:01:03] [INFO ] State equation strengthened by 3 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp87 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 11/11 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 27/38 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/40 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/40 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 1/56 variables, 1/41 constraints. Problems are: Problem set: 24 solved, 31 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 41 constraints, problems are : Problem set: 24 solved, 31 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 4/11 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 28/55 variables, 27/38 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 2/40 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 31/71 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/71 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/72 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/72 constraints. Problems are: Problem set: 24 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/72 constraints. Problems are: Problem set: 24 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 72 constraints, problems are : Problem set: 24 solved, 31 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 31/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 920ms problems are : Problem set: 24 solved, 31 unsolved
Fused 31 Parikh solutions to 30 different solutions.
Parikh walk visited 22 properties in 35002 ms.
Support contains 14 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 29/29 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 28
Applied a total of 1 rules in 12 ms. Remains 27 /27 variables (removed 0) and now considering 28/29 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 27/27 places, 28/29 transitions.
RANDOM walk for 40984 steps (8 resets) in 110 ms. (369 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 310088 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 9
Probabilistic random walk after 310088 steps, saw 229826 distinct states, run finished after 3021 ms. (steps per millisecond=102 ) properties seen :0
// Phase 1: matrix 28 rows 27 cols
[2024-05-31 18:01:42] [INFO ] Computed 11 invariants in 2 ms
[2024-05-31 18:01:42] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 11/25 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 28/53 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/55 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/55 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 40 constraints, problems are : Problem set: 0 solved, 9 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 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/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 11/25 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 28/53 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/55 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/55 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 49 constraints, problems are : Problem set: 0 solved, 9 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 27/27 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 6 properties in 37195 ms.
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 28/28 transitions.
Graph (trivial) has 2 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 29 ms. Remains 26 /27 variables (removed 1) and now considering 26/28 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 26/27 places, 26/28 transitions.
RANDOM walk for 40985 steps (8 resets) in 15 ms. (2561 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 840174 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 3
Probabilistic random walk after 840174 steps, saw 657270 distinct states, run finished after 3002 ms. (steps per millisecond=279 ) properties seen :0
// Phase 1: matrix 26 rows 26 cols
[2024-05-31 18:02:23] [INFO ] Computed 11 invariants in 2 ms
[2024-05-31 18:02:23] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/52 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 39 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 26/26 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/41 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/52 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 3 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 26/26 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2899561 steps, including 92 resets, run visited all 3 properties in 7153 ms. (steps per millisecond=405 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7164 ms.
Successfully simplified 24 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 18:02:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 6 ms
FORMULA CloudOpsManagement-PT-05120by02560-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 3 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 3 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 1 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 1 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 3 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 27
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 26 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 24 transition count 26
Applied a total of 5 rules in 8 ms. Remains 24 /27 variables (removed 3) and now considering 26/29 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 24/27 places, 26/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Graph (trivial) has 9 edges and 27 vertex of which 8 / 27 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 23 transition count 22
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 23 transition count 19
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 19
Applied a total of 13 rules in 3 ms. Remains 17 /27 variables (removed 10) and now considering 19/29 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 17/27 places, 19/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 1 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 29/29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Flatten gal took : 2 ms
[2024-05-31 18:02:30] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 18:02:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 29 transitions and 94 arcs took 3 ms.
Total runtime 89652 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
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="CloudOpsManagement-PT-05120by02560"
export BK_EXAMINATION="CTLCardinality"
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 CloudOpsManagement-PT-05120by02560, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624188600089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-05120by02560.tgz
mv CloudOpsManagement-PT-05120by02560 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;