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-171624189300441.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 DBSingleClientW-PT-d0m05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189300441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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 3.9K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K 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 DBSingleClientW-PT-d0m05-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717188818878

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:53:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:53:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:53:40] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-31 20:53:40] [INFO ] Transformed 553 places.
[2024-05-31 20:53:40] [INFO ] Transformed 150 transitions.
[2024-05-31 20:53:40] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 444 places in 5 ms
Reduce places removed 444 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 37 place count 83 transition count 103
Iterating global reduction 1 with 19 rules applied. Total rules applied 56 place count 83 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 83 transition count 102
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 66 place count 74 transition count 93
Iterating global reduction 2 with 9 rules applied. Total rules applied 75 place count 74 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 73 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 73 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 72 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 72 transition count 90
Applied a total of 79 rules in 44 ms. Remains 72 /109 variables (removed 37) and now considering 90/150 (removed 60) transitions.
// Phase 1: matrix 90 rows 72 cols
[2024-05-31 20:53:40] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 20:53:40] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-31 20:53:40] [INFO ] Invariant cache hit.
[2024-05-31 20:53:41] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:53:41] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-31 20:53:41] [INFO ] Invariant cache hit.
[2024-05-31 20:53:41] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/162 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-31 20:53:43] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 16 ms to minimize.
[2024-05-31 20:53:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-31 20:53:43] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/162 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 27/104 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 89/193 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 193 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
After SMT, in 6793ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 6816ms
Starting structural reductions in LTL mode, iteration 1 : 72/109 places, 90/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7481 ms. Remains : 72/109 places, 90/150 transitions.
Support contains 11 out of 72 places after structural reductions.
[2024-05-31 20:53:48] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-31 20:53:48] [INFO ] Flatten gal took : 31 ms
[2024-05-31 20:53:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:53:48] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:53:48] [INFO ] Input system was already deterministic with 90 transitions.
Support contains 6 out of 72 places (down from 11) after GAL structural reductions.
RANDOM walk for 40000 steps (9116 resets) in 1638 ms. (24 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (4123 resets) in 252 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4003 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4039 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (4087 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4163 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
[2024-05-31 20:53:49] [INFO ] Invariant cache hit.
[2024-05-31 20:53:49] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/32 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 22/54 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 75/129 variables, 54/56 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 12/68 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 8 (OVERLAPS) 31/160 variables, 17/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 14/99 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 11 (OVERLAPS) 2/162 variables, 1/100 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 1/101 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/101 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/101 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 101 constraints, problems are : Problem set: 4 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/74 variables, 5/6 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 5/11 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/101 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 27/40 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/124 variables, 1/41 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 9/50 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/50 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 36/160 variables, 29/79 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 21/100 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/160 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/162 variables, 1/101 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 1/102 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/162 variables, 0/102 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/162 variables, 0/102 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 102 constraints, problems are : Problem set: 4 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 295ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 90/90 transitions.
Graph (complete) has 219 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 71 transition count 89
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 66 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 66 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 64 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 64 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 62 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 62 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 60 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 59 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 59 transition count 69
Applied a total of 31 rules in 44 ms. Remains 59 /72 variables (removed 13) and now considering 69/90 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 59/72 places, 69/90 transitions.
RANDOM walk for 40000 steps (9065 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4110 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3931 steps, run visited all 1 properties in 30 ms. (steps per millisecond=131 )
Probabilistic random walk after 3931 steps, saw 1771 distinct states, run finished after 48 ms. (steps per millisecond=81 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 19 ms
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:53:49] [INFO ] Input system was already deterministic with 90 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 239 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 66 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 66 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 63 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 61 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 58 transition count 64
Applied a total of 35 rules in 26 ms. Remains 58 /72 variables (removed 14) and now considering 64/90 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 58/72 places, 64/90 transitions.
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:53:49] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 90/90 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 65 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 65 transition count 81
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 63 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 63 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 60 transition count 70
Applied a total of 29 rules in 20 ms. Remains 60 /72 variables (removed 12) and now considering 70/90 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 60/72 places, 70/90 transitions.
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 6 ms
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:53:49] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 66 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 66 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 63 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 61 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 58 transition count 64
Applied a total of 35 rules in 7 ms. Remains 58 /72 variables (removed 14) and now considering 64/90 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 58/72 places, 64/90 transitions.
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:53:49] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 90/90 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 64 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 64 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 62 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 60 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 59 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 59 transition count 66
Applied a total of 32 rules in 7 ms. Remains 59 /72 variables (removed 13) and now considering 66/90 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 59/72 places, 66/90 transitions.
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:53:49] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 6 ms
[2024-05-31 20:53:49] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:53:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:53:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 90 transitions and 355 arcs took 2 ms.
Total runtime 9814 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 : DBSingleClientW-PT-d0m05-CTLCardinality-2024-01
Could not compute solution for formula : DBSingleClientW-PT-d0m05-CTLCardinality-2024-04
Could not compute solution for formula : DBSingleClientW-PT-d0m05-CTLCardinality-2024-10
Could not compute solution for formula : DBSingleClientW-PT-d0m05-CTLCardinality-2023-14

BK_STOP 1717188830370

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DBSingleClientW-PT-d0m05-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/523/ctl_0_
ctl formula name DBSingleClientW-PT-d0m05-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/523/ctl_1_
ctl formula name DBSingleClientW-PT-d0m05-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/523/ctl_2_
ctl formula name DBSingleClientW-PT-d0m05-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/523/ctl_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m05"
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 DBSingleClientW-PT-d0m05, 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-171624189300441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m05.tgz
mv DBSingleClientW-PT-d0m05 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;