fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r091-tall-171624187800497
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DBSingleClientW-PT-d1m05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3690.924 711447.00 749168.00 2147.50 FFTFFFTFFF?TTTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187800497.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 greatspnxred
Input is DBSingleClientW-PT-d1m05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187800497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:52 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-d1m05-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716289508135

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:05:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 11:05:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:05:09] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-21 11:05:09] [INFO ] Transformed 1440 places.
[2024-05-21 11:05:09] [INFO ] Transformed 672 transitions.
[2024-05-21 11:05:09] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 327 transition count 611
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 167 place count 241 transition count 372
Iterating global reduction 1 with 86 rules applied. Total rules applied 253 place count 241 transition count 372
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 262 place count 241 transition count 363
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 322 place count 181 transition count 303
Iterating global reduction 2 with 60 rules applied. Total rules applied 382 place count 181 transition count 303
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 385 place count 181 transition count 300
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 415 place count 151 transition count 254
Iterating global reduction 3 with 30 rules applied. Total rules applied 445 place count 151 transition count 254
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 462 place count 151 transition count 237
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 466 place count 147 transition count 230
Iterating global reduction 4 with 4 rules applied. Total rules applied 470 place count 147 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 473 place count 147 transition count 227
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 475 place count 145 transition count 225
Iterating global reduction 5 with 2 rules applied. Total rules applied 477 place count 145 transition count 225
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 479 place count 143 transition count 223
Iterating global reduction 5 with 2 rules applied. Total rules applied 481 place count 143 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 482 place count 143 transition count 222
Applied a total of 482 rules in 90 ms. Remains 143 /347 variables (removed 204) and now considering 222/672 (removed 450) transitions.
// Phase 1: matrix 222 rows 143 cols
[2024-05-21 11:05:09] [INFO ] Computed 2 invariants in 22 ms
[2024-05-21 11:05:10] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-21 11:05:10] [INFO ] Invariant cache hit.
[2024-05-21 11:05:10] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-21 11:05:10] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 11:05:10] [INFO ] Invariant cache hit.
[2024-05-21 11:05:10] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/364 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 238 constraints, problems are : Problem set: 0 solved, 221 unsolved in 11580 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/364 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 197/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 24/459 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 459 constraints, problems are : Problem set: 0 solved, 221 unsolved in 28071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 40249ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 40266ms
Starting structural reductions in LTL mode, iteration 1 : 143/347 places, 222/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41117 ms. Remains : 143/347 places, 222/672 transitions.
Support contains 23 out of 143 places after structural reductions.
[2024-05-21 11:05:50] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-21 11:05:50] [INFO ] Flatten gal took : 42 ms
[2024-05-21 11:05:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 11:05:50] [INFO ] Flatten gal took : 19 ms
[2024-05-21 11:05:51] [INFO ] Input system was already deterministic with 222 transitions.
Support contains 8 out of 143 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (9224 resets) in 1725 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3936 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3781 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3993 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3884 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3925 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3939 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3851 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3881 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 415282 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :2 out of 8
Probabilistic random walk after 415282 steps, saw 162097 distinct states, run finished after 3004 ms. (steps per millisecond=138 ) properties seen :2
[2024-05-21 11:05:55] [INFO ] Invariant cache hit.
[2024-05-21 11:05:55] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/59 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 39/98 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 154/252 variables, 98/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 25/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 8 (OVERLAPS) 103/355 variables, 40/165 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 63/228 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/228 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 11 (OVERLAPS) 10/365 variables, 5/233 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 5/238 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/238 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/365 variables, 0/238 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 238 constraints, problems are : Problem set: 5 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 139/142 variables, 4/5 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 8/13 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 52/194 variables, 1/15 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 52/67 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/67 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/233 variables, 1/68 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 11/79 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/79 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 122/355 variables, 70/149 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 80/229 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/229 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/365 variables, 5/234 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 5/239 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 0/239 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/365 variables, 0/239 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 239 constraints, problems are : Problem set: 5 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 222/222 transitions.
Graph (complete) has 463 edges and 143 vertex of which 141 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 141 transition count 214
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 26 place count 124 transition count 179
Iterating global reduction 1 with 17 rules applied. Total rules applied 43 place count 124 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 124 transition count 175
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 61 place count 110 transition count 159
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 110 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 110 transition count 152
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 89 place count 103 transition count 138
Iterating global reduction 3 with 7 rules applied. Total rules applied 96 place count 103 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 103 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 103 place count 97 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 109 place count 97 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 97 transition count 127
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 115 place count 92 transition count 122
Iterating global reduction 5 with 5 rules applied. Total rules applied 120 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 122 place count 92 transition count 120
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 125 place count 89 transition count 117
Iterating global reduction 6 with 3 rules applied. Total rules applied 128 place count 89 transition count 117
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 130 place count 87 transition count 109
Iterating global reduction 6 with 2 rules applied. Total rules applied 132 place count 87 transition count 109
Applied a total of 132 rules in 53 ms. Remains 87 /143 variables (removed 56) and now considering 109/222 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 87/143 places, 109/222 transitions.
RANDOM walk for 40000 steps (9152 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3962 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Probably explored full state space saw : 93725 states, properties seen :0
Probabilistic random walk after 235011 steps, saw 93725 distinct states, run finished after 228 ms. (steps per millisecond=1030 ) properties seen :0
Explored full state space saw : 94420 states, properties seen :0
Exhaustive walk after 236721 steps, saw 94420 distinct states, run finished after 202 ms. (steps per millisecond=1171 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 12 ms
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 12 ms
[2024-05-21 11:05:56] [INFO ] Input system was already deterministic with 222 transitions.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 508 edges and 143 vertex of which 141 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 222/222 transitions.
Graph (complete) has 508 edges and 143 vertex of which 142 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 142 transition count 218
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 22 place count 125 transition count 182
Iterating global reduction 1 with 17 rules applied. Total rules applied 39 place count 125 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 125 transition count 178
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 57 place count 111 transition count 162
Iterating global reduction 2 with 14 rules applied. Total rules applied 71 place count 111 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 77 place count 111 transition count 156
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 85 place count 103 transition count 138
Iterating global reduction 3 with 8 rules applied. Total rules applied 93 place count 103 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 101 place count 96 transition count 126
Iterating global reduction 4 with 7 rules applied. Total rules applied 108 place count 96 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 109 place count 96 transition count 125
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 115 place count 90 transition count 119
Iterating global reduction 5 with 6 rules applied. Total rules applied 121 place count 90 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 125 place count 90 transition count 115
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 128 place count 87 transition count 112
Iterating global reduction 6 with 3 rules applied. Total rules applied 131 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 86 transition count 110
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 86 transition count 110
Applied a total of 133 rules in 36 ms. Remains 86 /143 variables (removed 57) and now considering 110/222 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 86/143 places, 110/222 transitions.
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:05:56] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 222/222 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 142 transition count 218
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 124 transition count 181
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 124 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 45 place count 124 transition count 177
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 60 place count 109 transition count 160
Iterating global reduction 2 with 15 rules applied. Total rules applied 75 place count 109 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 82 place count 109 transition count 153
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 90 place count 101 transition count 135
Iterating global reduction 3 with 8 rules applied. Total rules applied 98 place count 101 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 101 transition count 134
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 106 place count 94 transition count 123
Iterating global reduction 4 with 7 rules applied. Total rules applied 113 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 114 place count 94 transition count 122
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 120 place count 88 transition count 116
Iterating global reduction 5 with 6 rules applied. Total rules applied 126 place count 88 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 130 place count 88 transition count 112
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 133 place count 85 transition count 109
Iterating global reduction 6 with 3 rules applied. Total rules applied 136 place count 85 transition count 109
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 138 place count 83 transition count 101
Iterating global reduction 6 with 2 rules applied. Total rules applied 140 place count 83 transition count 101
Applied a total of 140 rules in 15 ms. Remains 83 /143 variables (removed 60) and now considering 101/222 (removed 121) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 83/143 places, 101/222 transitions.
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 11:05:56] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 222/222 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 142 transition count 218
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 22 place count 125 transition count 182
Iterating global reduction 1 with 17 rules applied. Total rules applied 39 place count 125 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 125 transition count 179
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 57 place count 110 transition count 162
Iterating global reduction 2 with 15 rules applied. Total rules applied 72 place count 110 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 79 place count 110 transition count 155
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 86 place count 103 transition count 139
Iterating global reduction 3 with 7 rules applied. Total rules applied 93 place count 103 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 103 transition count 138
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 100 place count 97 transition count 129
Iterating global reduction 4 with 6 rules applied. Total rules applied 106 place count 97 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 112 place count 91 transition count 123
Iterating global reduction 4 with 6 rules applied. Total rules applied 118 place count 91 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 91 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 125 place count 88 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 128 place count 88 transition count 116
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 86 transition count 108
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 86 transition count 108
Applied a total of 132 rules in 14 ms. Remains 86 /143 variables (removed 57) and now considering 108/222 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 86/143 places, 108/222 transitions.
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:05:56] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 13 ms
[2024-05-21 11:05:56] [INFO ] Flatten gal took : 12 ms
[2024-05-21 11:05:56] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-21 11:05:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 222 transitions and 873 arcs took 3 ms.
Total runtime 46948 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 143
TRANSITIONS: 222
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 556
MODEL NAME: /home/mcc/execution/411/model
143 places, 222 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716290219582

--------------------
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
MEDDLY ERROR: Insufficient memory

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-d1m05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d1m05, 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 r091-tall-171624187800497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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