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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 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 1.6M 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-d2m07-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m07-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716301031088

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-d2m07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:17:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 14:17:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:17:12] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-05-21 14:17:12] [INFO ] Transformed 4763 places.
[2024-05-21 14:17:12] [INFO ] Transformed 2478 transitions.
[2024-05-21 14:17:12] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 3580 places in 29 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1138 transition count 2280
Discarding 382 places :
Symmetric choice reduction at 1 with 382 rule applications. Total rules 625 place count 756 transition count 1226
Iterating global reduction 1 with 382 rules applied. Total rules applied 1007 place count 756 transition count 1226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1015 place count 756 transition count 1218
Discarding 308 places :
Symmetric choice reduction at 2 with 308 rule applications. Total rules 1323 place count 448 transition count 910
Iterating global reduction 2 with 308 rules applied. Total rules applied 1631 place count 448 transition count 910
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1640 place count 448 transition count 901
Discarding 225 places :
Symmetric choice reduction at 3 with 225 rule applications. Total rules 1865 place count 223 transition count 588
Iterating global reduction 3 with 225 rules applied. Total rules applied 2090 place count 223 transition count 588
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 3 with 200 rules applied. Total rules applied 2290 place count 223 transition count 388
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2311 place count 202 transition count 348
Iterating global reduction 4 with 21 rules applied. Total rules applied 2332 place count 202 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2336 place count 202 transition count 344
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2350 place count 188 transition count 330
Iterating global reduction 5 with 14 rules applied. Total rules applied 2364 place count 188 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2366 place count 188 transition count 328
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2378 place count 176 transition count 316
Iterating global reduction 6 with 12 rules applied. Total rules applied 2390 place count 176 transition count 316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2398 place count 176 transition count 308
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2400 place count 174 transition count 301
Iterating global reduction 7 with 2 rules applied. Total rules applied 2402 place count 174 transition count 301
Applied a total of 2402 rules in 203 ms. Remains 174 /1183 variables (removed 1009) and now considering 301/2478 (removed 2177) transitions.
// Phase 1: matrix 301 rows 174 cols
[2024-05-21 14:17:13] [INFO ] Computed 2 invariants in 24 ms
[2024-05-21 14:17:13] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-21 14:17:13] [INFO ] Invariant cache hit.
[2024-05-21 14:17:13] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-21 14:17:13] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-05-21 14:17:13] [INFO ] Invariant cache hit.
[2024-05-21 14:17:13] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/474 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 126/301 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/475 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 300 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/475 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 302 constraints, problems are : Problem set: 0 solved, 300 unsolved in 23657 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 301/474 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 126/301 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 297/598 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/475 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 3/602 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 602 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 54542ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 54563ms
Starting structural reductions in LTL mode, iteration 1 : 174/1183 places, 301/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55723 ms. Remains : 174/1183 places, 301/2478 transitions.
Support contains 22 out of 174 places after structural reductions.
[2024-05-21 14:18:08] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 14:18:08] [INFO ] Flatten gal took : 63 ms
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:18:08] [INFO ] Flatten gal took : 28 ms
[2024-05-21 14:18:08] [INFO ] Input system was already deterministic with 301 transitions.
Support contains 10 out of 174 places (down from 22) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9121 resets) in 2035 ms. (19 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (3854 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3758 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3839 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3715 resets) in 294 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3787 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3753 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3793 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3821 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
[2024-05-21 14:18:10] [INFO ] Invariant cache hit.
[2024-05-21 14:18:10] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/74 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 38/112 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 201/313 variables, 112/114 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 26/140 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 8 (OVERLAPS) 151/464 variables, 56/196 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 95/291 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/291 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 11 (OVERLAPS) 11/475 variables, 6/297 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 5/302 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/302 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/475 variables, 0/302 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 302 constraints, problems are : Problem set: 5 solved, 3 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 38/109 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-21 14:18:10] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 196/305 variables, 109/112 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 21/133 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/134 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/134 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 157/462 variables, 58/192 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 99/291 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 2/293 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/293 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 14 (OVERLAPS) 13/475 variables, 7/300 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 6/306 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/475 variables, 0/306 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/475 variables, 0/306 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 306 constraints, problems are : Problem set: 6 solved, 2 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1134ms problems are : Problem set: 6 solved, 2 unsolved
Parikh walk visited 0 properties in 296 ms.
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 301/301 transitions.
Graph (complete) has 620 edges and 174 vertex of which 172 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 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 172 transition count 294
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 26 place count 154 transition count 275
Iterating global reduction 1 with 18 rules applied. Total rules applied 44 place count 154 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 50 place count 154 transition count 269
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 61 place count 143 transition count 246
Iterating global reduction 2 with 11 rules applied. Total rules applied 72 place count 143 transition count 246
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 143 transition count 239
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 85 place count 137 transition count 226
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 137 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 137 transition count 224
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 134 transition count 221
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 134 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 103 place count 134 transition count 217
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 104 place count 133 transition count 216
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 133 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 108 place count 133 transition count 213
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 111 place count 130 transition count 193
Iterating global reduction 6 with 3 rules applied. Total rules applied 114 place count 130 transition count 193
Applied a total of 114 rules in 50 ms. Remains 130 /174 variables (removed 44) and now considering 193/301 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 130/174 places, 193/301 transitions.
RANDOM walk for 40000 steps (9183 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3852 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3804 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 42434 steps, run visited all 2 properties in 190 ms. (steps per millisecond=223 )
Probabilistic random walk after 42434 steps, saw 19844 distinct states, run finished after 194 ms. (steps per millisecond=218 ) properties seen :2
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:18:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 14:18:11] [INFO ] Flatten gal took : 17 ms
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:18:11] [INFO ] Flatten gal took : 16 ms
[2024-05-21 14:18:11] [INFO ] Input system was already deterministic with 301 transitions.
Computed a total of 5 stabilizing places and 25 stable transitions
Graph (complete) has 664 edges and 174 vertex of which 172 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 301/301 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 173 transition count 300
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 155 transition count 280
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 155 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 44 place count 155 transition count 274
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 55 place count 144 transition count 251
Iterating global reduction 2 with 11 rules applied. Total rules applied 66 place count 144 transition count 251
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 73 place count 144 transition count 244
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 79 place count 138 transition count 230
Iterating global reduction 3 with 6 rules applied. Total rules applied 85 place count 138 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 138 transition count 228
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 90 place count 135 transition count 225
Iterating global reduction 4 with 3 rules applied. Total rules applied 93 place count 135 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 97 place count 135 transition count 221
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 134 transition count 220
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 134 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 102 place count 134 transition count 217
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 105 place count 131 transition count 197
Iterating global reduction 6 with 3 rules applied. Total rules applied 108 place count 131 transition count 197
Applied a total of 108 rules in 16 ms. Remains 131 /174 variables (removed 43) and now considering 197/301 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 131/174 places, 197/301 transitions.
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 21 ms
[2024-05-21 14:18:12] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 301/301 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 173 transition count 300
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 153 transition count 272
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 153 transition count 272
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 48 place count 153 transition count 266
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 61 place count 140 transition count 240
Iterating global reduction 2 with 13 rules applied. Total rules applied 74 place count 140 transition count 240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 84 place count 140 transition count 230
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 132 transition count 207
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 132 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 132 transition count 205
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 128 transition count 200
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 128 transition count 200
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 115 place count 128 transition count 195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 127 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 127 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 120 place count 127 transition count 191
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 123 place count 124 transition count 171
Iterating global reduction 6 with 3 rules applied. Total rules applied 126 place count 124 transition count 171
Applied a total of 126 rules in 20 ms. Remains 124 /174 variables (removed 50) and now considering 171/301 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 124/174 places, 171/301 transitions.
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 14:18:12] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 301/301 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 173 transition count 300
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 153 transition count 272
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 153 transition count 272
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 48 place count 153 transition count 266
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 61 place count 140 transition count 240
Iterating global reduction 2 with 13 rules applied. Total rules applied 74 place count 140 transition count 240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 84 place count 140 transition count 230
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 132 transition count 207
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 132 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 132 transition count 205
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 128 transition count 200
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 128 transition count 200
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 115 place count 128 transition count 195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 127 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 127 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 120 place count 127 transition count 191
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 123 place count 124 transition count 171
Iterating global reduction 6 with 3 rules applied. Total rules applied 126 place count 124 transition count 171
Applied a total of 126 rules in 15 ms. Remains 124 /174 variables (removed 50) and now considering 171/301 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 124/174 places, 171/301 transitions.
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:18:12] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 301/301 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 173 transition count 300
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 154 transition count 273
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 154 transition count 273
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 46 place count 154 transition count 267
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 58 place count 142 transition count 243
Iterating global reduction 2 with 12 rules applied. Total rules applied 70 place count 142 transition count 243
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 79 place count 142 transition count 234
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 86 place count 135 transition count 212
Iterating global reduction 3 with 7 rules applied. Total rules applied 93 place count 135 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 135 transition count 210
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 132 transition count 206
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 132 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 132 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 131 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 131 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 109 place count 131 transition count 199
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 112 place count 128 transition count 179
Iterating global reduction 6 with 3 rules applied. Total rules applied 115 place count 128 transition count 179
Applied a total of 115 rules in 13 ms. Remains 128 /174 variables (removed 46) and now considering 179/301 (removed 122) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 128/174 places, 179/301 transitions.
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:18:12] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 301/301 transitions.
Graph (complete) has 664 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 173 transition count 300
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 154 transition count 273
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 154 transition count 273
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 46 place count 154 transition count 267
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 58 place count 142 transition count 243
Iterating global reduction 2 with 12 rules applied. Total rules applied 70 place count 142 transition count 243
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 79 place count 142 transition count 234
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 86 place count 135 transition count 212
Iterating global reduction 3 with 7 rules applied. Total rules applied 93 place count 135 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 135 transition count 210
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 132 transition count 206
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 132 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 132 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 131 transition count 202
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 131 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 109 place count 131 transition count 199
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 112 place count 128 transition count 179
Iterating global reduction 6 with 3 rules applied. Total rules applied 115 place count 128 transition count 179
Applied a total of 115 rules in 41 ms. Remains 128 /174 variables (removed 46) and now considering 179/301 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 128/174 places, 179/301 transitions.
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 14:18:12] [INFO ] Input system was already deterministic with 179 transitions.
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 14:18:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 14:18:12] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-21 14:18:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 301 transitions and 1184 arcs took 4 ms.
Total runtime 60063 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d2m07

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 174
TRANSITIONS: 301
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 558
MODEL NAME: /home/mcc/execution/409/model
174 places, 301 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-d2m07-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d2m07-CTLCardinality-2024-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716302485244

--------------------
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

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-d2m07"
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-d2m07, 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-171624188000569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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