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.r528-tall-171683762100890.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 ShieldRVt-PT-001B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762100890
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 21:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 21:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 21:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 21:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13K 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 ShieldRVt-PT-001B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717274633168

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:43:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:43:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:43:54] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-06-01 20:43:54] [INFO ] Transformed 53 places.
[2024-06-01 20:43:54] [INFO ] Transformed 53 transitions.
[2024-06-01 20:43:54] [INFO ] Found NUPN structural information;
[2024-06-01 20:43:54] [INFO ] Parsed PT model containing 53 places and 53 transitions and 124 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-001B-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Applied a total of 0 rules in 15 ms. Remains 53 /53 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 53 cols
[2024-06-01 20:43:54] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 20:43:54] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 20:43:54] [INFO ] Invariant cache hit.
[2024-06-01 20:43:54] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-06-01 20:43:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 16 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 4 ms to minimize.
[2024-06-01 20:43:55] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:43:56] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-06-01 20:43:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:43:56] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:43:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:56] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 53/106 variables, 53/131 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:56] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-06-01 20:43:57] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:57] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 134 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2702 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 23/81 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:57] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 1 ms to minimize.
[2024-06-01 20:43:58] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:58] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 53/106 variables, 53/137 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 52/189 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 20:43:58] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 190 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1753 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 27/27 constraints]
After SMT, in 4493ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4502ms
Finished structural reductions in LTL mode , in 1 iterations and 4776 ms. Remains : 53/53 places, 53/53 transitions.
Support contains 51 out of 53 places after structural reductions.
[2024-06-01 20:43:59] [INFO ] Flatten gal took : 20 ms
[2024-06-01 20:43:59] [INFO ] Flatten gal took : 16 ms
[2024-06-01 20:43:59] [INFO ] Input system was already deterministic with 53 transitions.
Reduction of identical properties reduced properties to check from 56 to 55
RANDOM walk for 40000 steps (32 resets) in 1889 ms. (21 steps per ms) remains 9/55 properties
BEST_FIRST walk for 40003 steps (10 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (27 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (26 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (14 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
[2024-06-01 20:44:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 2 (OVERLAPS) 32/53 variables, 5/26 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 32/58 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-06-01 20:44:00] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 9 ms to minimize.
[2024-06-01 20:44:00] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-06-01 20:44:00] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
Problem AtomicPropp4 is UNSAT
[2024-06-01 20:44:00] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/62 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/62 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/106 variables, 53/115 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/115 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/115 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 115 constraints, problems are : Problem set: 8 solved, 1 unsolved in 237 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/29 variables, 2/4 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 27/31 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/31 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/53 variables, 3/34 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 24/58 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 4/62 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/62 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/106 variables, 53/115 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/116 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-06-01 20:44:00] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/117 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 117 constraints, problems are : Problem set: 8 solved, 1 unsolved in 133 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 379ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 53/53 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 53 transition count 37
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 37 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 36 transition count 35
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 36 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 43 place count 32 transition count 31
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 27 transition count 26
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 27 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 53 place count 27 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 25 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 75 place count 16 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 14 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 14 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 13 transition count 14
Applied a total of 81 rules in 22 ms. Remains 13 /53 variables (removed 40) and now considering 14/53 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 13/53 places, 14/53 transitions.
RANDOM walk for 40000 steps (682 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (265 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Probably explored full state space saw : 50 states, properties seen :0
Probabilistic random walk after 172 steps, saw 50 distinct states, run finished after 10 ms. (steps per millisecond=17 ) properties seen :0
Explored full state space saw : 50 states, properties seen :0
Exhaustive walk after 172 steps, saw 50 distinct states, run finished after 2 ms. (steps per millisecond=86 ) properties seen :0
Successfully simplified 9 atomic propositions for a total of 15 simplifications.
FORMULA ShieldRVt-PT-001B-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:44:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:44:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-001B-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 5 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 39 out of 53 places (down from 46) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 43
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 43 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 42 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 42 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 37 transition count 37
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 37 place count 30 transition count 30
Iterating global reduction 3 with 7 rules applied. Total rules applied 44 place count 30 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 3 with 2 rules applied. Total rules applied 46 place count 30 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 47 place count 29 transition count 28
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 47 place count 29 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 53 place count 26 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 59 place count 23 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 23 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 22 transition count 21
Applied a total of 61 rules in 10 ms. Remains 22 /53 variables (removed 31) and now considering 21/53 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 22/53 places, 21/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 1 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 40 transition count 40
Applied a total of 26 rules in 6 ms. Remains 40 /53 variables (removed 13) and now considering 40/53 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 40/53 places, 40/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 52 transition count 38
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 with 16 rules applied. Total rules applied 30 place count 38 transition count 36
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 37 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 37 place count 34 transition count 33
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 37 place count 34 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 45 place count 30 transition count 29
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 50 place count 25 transition count 24
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 25 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 25 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 23 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 17 transition count 16
Applied a total of 71 rules in 6 ms. Remains 17 /53 variables (removed 36) and now considering 16/53 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 17/53 places, 16/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 1 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 1 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 45 transition count 45
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 45 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 44 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Applied a total of 20 rules in 3 ms. Remains 43 /53 variables (removed 10) and now considering 43/53 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/53 places, 43/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 3 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/53 places, 42/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 46 transition count 46
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 46 transition count 46
Applied a total of 14 rules in 2 ms. Remains 46 /53 variables (removed 7) and now considering 46/53 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/53 places, 46/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 45 transition count 45
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 45 transition count 45
Applied a total of 16 rules in 2 ms. Remains 45 /53 variables (removed 8) and now considering 45/53 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/53 places, 45/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Applied a total of 24 rules in 3 ms. Remains 41 /53 variables (removed 12) and now considering 41/53 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 41/53 places, 41/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 1 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 1 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Applied a total of 18 rules in 2 ms. Remains 44 /53 variables (removed 9) and now considering 44/53 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/53 places, 44/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 40 transition count 40
Applied a total of 26 rules in 4 ms. Remains 40 /53 variables (removed 13) and now considering 40/53 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 40/53 places, 40/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 4 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/53 places, 42/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 52 transition count 44
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 44 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 43 transition count 43
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 43 transition count 38
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 38 transition count 38
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 35 place count 31 transition count 31
Iterating global reduction 3 with 7 rules applied. Total rules applied 42 place count 31 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 42 place count 31 transition count 29
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 29 transition count 29
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 23 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 22 transition count 22
Applied a total of 59 rules in 6 ms. Remains 22 /53 variables (removed 31) and now considering 22/53 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 22/53 places, 22/53 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 1 ms
[2024-06-01 20:44:01] [INFO ] Input system was already deterministic with 22 transitions.
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:44:01] [INFO ] Flatten gal took : 2 ms
[2024-06-01 20:44:01] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-01 20:44:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 53 transitions and 124 arcs took 1 ms.
Total runtime 7070 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 : ShieldRVt-PT-001B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVt-PT-001B-CTLFireability-2023-14

BK_STOP 1717274641715

--------------------
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 ShieldRVt-PT-001B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/602/ctl_0_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/602/ctl_1_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/602/ctl_2_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/602/ctl_3_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/602/ctl_4_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/602/ctl_5_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/602/ctl_6_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/602/ctl_7_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/602/ctl_8_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/602/ctl_9_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/602/ctl_10_
ctl formula name ShieldRVt-PT-001B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/602/ctl_11_
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="ShieldRVt-PT-001B"
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 ShieldRVt-PT-001B, 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 r528-tall-171683762100890"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001B.tgz
mv ShieldRVt-PT-001B 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 ;