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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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 432K 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-d1m08-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m08-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717189608853

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-d1m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:06:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:06:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:06:50] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-31 21:06:50] [INFO ] Transformed 1440 places.
[2024-05-31 21:06:50] [INFO ] Transformed 672 transitions.
[2024-05-31 21:06:50] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 327 transition count 594
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 187 place count 238 transition count 344
Iterating global reduction 1 with 89 rules applied. Total rules applied 276 place count 238 transition count 344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 279 place count 238 transition count 341
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 345 place count 172 transition count 275
Iterating global reduction 2 with 66 rules applied. Total rules applied 411 place count 172 transition count 275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 416 place count 172 transition count 270
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 448 place count 140 transition count 225
Iterating global reduction 3 with 32 rules applied. Total rules applied 480 place count 140 transition count 225
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 499 place count 140 transition count 206
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 505 place count 134 transition count 193
Iterating global reduction 4 with 6 rules applied. Total rules applied 511 place count 134 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 512 place count 134 transition count 192
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 516 place count 130 transition count 188
Iterating global reduction 5 with 4 rules applied. Total rules applied 520 place count 130 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 522 place count 130 transition count 186
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 525 place count 127 transition count 183
Iterating global reduction 6 with 3 rules applied. Total rules applied 528 place count 127 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 530 place count 127 transition count 181
Applied a total of 530 rules in 110 ms. Remains 127 /347 variables (removed 220) and now considering 181/672 (removed 491) transitions.
// Phase 1: matrix 181 rows 127 cols
[2024-05-31 21:06:50] [INFO ] Computed 2 invariants in 21 ms
[2024-05-31 21:06:51] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 21:06:51] [INFO ] Invariant cache hit.
[2024-05-31 21:06:51] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-31 21:06:51] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-31 21:06:51] [INFO ] Invariant cache hit.
[2024-05-31 21:06:51] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/307 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 64/192 constraints. Problems are: Problem set: 0 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 1/308 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 193 constraints, problems are : Problem set: 0 solved, 180 unsolved in 8261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/307 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 64/192 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 172/364 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 1/308 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 373 constraints, problems are : Problem set: 0 solved, 180 unsolved in 15989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
After SMT, in 24663ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 24679ms
Starting structural reductions in LTL mode, iteration 1 : 127/347 places, 181/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25435 ms. Remains : 127/347 places, 181/672 transitions.
Support contains 16 out of 127 places after structural reductions.
[2024-05-31 21:07:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-31 21:07:16] [INFO ] Flatten gal took : 39 ms
[2024-05-31 21:07:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:07:16] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:07:16] [INFO ] Input system was already deterministic with 181 transitions.
Support contains 13 out of 127 places (down from 16) after GAL structural reductions.
RANDOM walk for 40000 steps (9287 resets) in 1601 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (3860 resets) in 466 ms. (85 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (3985 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (3912 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (3898 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (3957 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (3887 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2873 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (3833 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (3948 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (3882 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (3959 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 589502 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :4 out of 11
Probabilistic random walk after 589502 steps, saw 216769 distinct states, run finished after 3004 ms. (steps per millisecond=196 ) properties seen :4
[2024-05-31 21:07:20] [INFO ] Invariant cache hit.
[2024-05-31 21:07:20] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 44/51 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 36/87 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 138/225 variables, 87/89 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 21/110 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/110 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 8 (OVERLAPS) 75/300 variables, 36/146 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 39/185 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/185 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/308 variables, 4/189 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 4/193 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/193 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/308 variables, 0/193 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 193 constraints, problems are : Problem set: 6 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/25 variables, 5/6 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/149 variables, 14/20 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 12/32 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 1/33 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/33 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/191 variables, 1/34 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 42/76 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/76 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/221 variables, 1/77 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 5/82 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/82 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 78/299 variables, 55/137 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 48/185 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 0/185 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/308 variables, 5/190 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/308 variables, 4/194 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 0/194 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/308 variables, 0/194 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 194 constraints, problems are : Problem set: 6 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Graph (complete) has 408 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 125 transition count 176
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 17 place count 114 transition count 165
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 114 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 114 transition count 162
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 41 place count 104 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 104 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 104 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 60 place count 98 transition count 130
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 98 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 98 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 72 place count 94 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 76 place count 94 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 94 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 80 place count 91 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 83 place count 91 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 85 place count 89 transition count 113
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 88 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 88 transition count 111
Applied a total of 89 rules in 41 ms. Remains 88 /127 variables (removed 39) and now considering 111/181 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 88/127 places, 111/181 transitions.
RANDOM walk for 40000 steps (9205 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4012 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2054074 steps, run timeout after 3001 ms. (steps per millisecond=684 ) properties seen :0 out of 1
Probabilistic random walk after 2054074 steps, saw 792484 distinct states, run finished after 3001 ms. (steps per millisecond=684 ) properties seen :0
// Phase 1: matrix 111 rows 88 cols
[2024-05-31 21:07:23] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:07:23] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/24 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/106 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 45/151 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/158 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 41/199 variables, 36/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 24/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/199 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/24 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/106 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 45/151 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/158 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 41/199 variables, 36/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 24/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/199 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/199 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/88 places, 111/111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-31 21:07:24] [INFO ] Invariant cache hit.
[2024-05-31 21:07:24] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 21:07:24] [INFO ] Invariant cache hit.
[2024-05-31 21:07:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:07:24] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-31 21:07:24] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-31 21:07:24] [INFO ] Invariant cache hit.
[2024-05-31 21:07:24] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 126 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2369 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 236 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4332 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6821ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6823ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7054 ms. Remains : 88/88 places, 111/111 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 88 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 86 transition count 103
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 86 transition count 94
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 28 place count 77 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 76 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 76 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 75 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 75 transition count 92
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 2 with 6 rules applied. Total rules applied 38 place count 72 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 70 transition count 125
Applied a total of 42 rules in 21 ms. Remains 70 /88 variables (removed 18) and now considering 125/111 (removed -14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 70 cols
[2024-05-31 21:07:31] [INFO ] Computed 5 invariants in 2 ms
[2024-05-31 21:07:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 21:07:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-31 21:07:31] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:07:31] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:07:31] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 122 ms.
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:07:31] [INFO ] Input system was already deterministic with 181 transitions.
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 444 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 181/181 transitions.
Graph (complete) has 444 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 180
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 115 transition count 164
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 115 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 115 transition count 161
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 37 place count 105 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 105 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 105 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 56 place count 99 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 99 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 99 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 68 place count 94 transition count 121
Iterating global reduction 4 with 5 rules applied. Total rules applied 73 place count 94 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 94 transition count 120
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 78 place count 90 transition count 116
Iterating global reduction 5 with 4 rules applied. Total rules applied 82 place count 90 transition count 116
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 84 place count 88 transition count 114
Iterating global reduction 5 with 2 rules applied. Total rules applied 86 place count 88 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 88 place count 87 transition count 111
Iterating global reduction 6 with 1 rules applied. Total rules applied 89 place count 87 transition count 111
Applied a total of 89 rules in 34 ms. Remains 87 /127 variables (removed 40) and now considering 111/181 (removed 70) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 87/127 places, 111/181 transitions.
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:07:31] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 181/181 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 116 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 116 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 116 transition count 163
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 34 place count 106 transition count 143
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 106 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 106 transition count 141
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 53 place count 99 transition count 131
Iterating global reduction 3 with 7 rules applied. Total rules applied 60 place count 99 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 99 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 67 place count 94 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 72 place count 94 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 94 transition count 122
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 76 place count 91 transition count 119
Iterating global reduction 5 with 3 rules applied. Total rules applied 79 place count 91 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 80 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 82 place count 89 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 89 transition count 116
Applied a total of 83 rules in 16 ms. Remains 89 /127 variables (removed 38) and now considering 116/181 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 89/127 places, 116/181 transitions.
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:07:31] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 181/181 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 180
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 114 transition count 163
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 114 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 114 transition count 160
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 40 place count 103 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 103 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 103 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 61 place count 96 transition count 125
Iterating global reduction 3 with 7 rules applied. Total rules applied 68 place count 96 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 96 transition count 123
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 75 place count 91 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 80 place count 91 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 91 transition count 116
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 85 place count 87 transition count 112
Iterating global reduction 5 with 4 rules applied. Total rules applied 89 place count 87 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 92 place count 84 transition count 104
Iterating global reduction 5 with 3 rules applied. Total rules applied 95 place count 84 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 96 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 97 place count 83 transition count 101
Iterating global reduction 6 with 1 rules applied. Total rules applied 98 place count 83 transition count 101
Applied a total of 98 rules in 15 ms. Remains 83 /127 variables (removed 44) and now considering 101/181 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 83/127 places, 101/181 transitions.
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:07:31] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 181/181 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 180
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 115 transition count 168
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 115 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 115 transition count 165
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 37 place count 105 transition count 144
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 105 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 105 transition count 141
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 56 place count 99 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 99 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 99 transition count 130
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 68 place count 95 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 95 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 95 transition count 125
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 76 place count 92 transition count 122
Iterating global reduction 5 with 3 rules applied. Total rules applied 79 place count 92 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 81 place count 90 transition count 115
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 90 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 84 place count 89 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 89 transition count 113
Applied a total of 85 rules in 13 ms. Remains 89 /127 variables (removed 38) and now considering 113/181 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 89/127 places, 113/181 transitions.
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:07:31] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 181/181 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 180
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 115 transition count 164
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 115 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 115 transition count 161
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 36 place count 106 transition count 141
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 106 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 106 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 54 place count 100 transition count 131
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 100 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 100 transition count 129
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 66 place count 96 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 96 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 96 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 74 place count 93 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 77 place count 93 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 79 place count 91 transition count 113
Iterating global reduction 5 with 2 rules applied. Total rules applied 81 place count 91 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 91 transition count 112
Applied a total of 82 rules in 19 ms. Remains 91 /127 variables (removed 36) and now considering 112/181 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 91/127 places, 112/181 transitions.
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:07:31] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:07:31] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:07:31] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 21:07:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 181 transitions and 712 arcs took 3 ms.
Total runtime 41535 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-d1m08-CTLCardinality-2024-04
Could not compute solution for formula : DBSingleClientW-PT-d1m08-CTLCardinality-2024-06
Could not compute solution for formula : DBSingleClientW-PT-d1m08-CTLCardinality-2024-10
Could not compute solution for formula : DBSingleClientW-PT-d1m08-CTLCardinality-2023-12
Could not compute solution for formula : DBSingleClientW-PT-d1m08-CTLCardinality-2023-14

BK_STOP 1717189651992

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-d1m08-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/555/ctl_0_
ctl formula name DBSingleClientW-PT-d1m08-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/555/ctl_1_
ctl formula name DBSingleClientW-PT-d1m08-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/555/ctl_2_
ctl formula name DBSingleClientW-PT-d1m08-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/555/ctl_3_
ctl formula name DBSingleClientW-PT-d1m08-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/555/ctl_4_
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-d1m08"
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-d1m08, 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-171624189500521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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