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

About the Execution of GreatSPN+red for CO4-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
414.651 8480.00 20048.00 54.70 TFTTFFFFFTTTTTFT 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.r549-tall-171734897900158.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 CO4-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897900158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 336K Jun 2 16:33 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 CO4-PT-20-ReachabilityCardinality-2024-00
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-01
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-02
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-03
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-04
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-05
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-06
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-07
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-08
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-09
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-10
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-11
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-12
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-13
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-14
FORMULA_NAME CO4-PT-20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717363272125

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:21:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:21:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:21:13] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-06-02 21:21:13] [INFO ] Transformed 1178 places.
[2024-06-02 21:21:13] [INFO ] Transformed 1463 transitions.
[2024-06-02 21:21:13] [INFO ] Found NUPN structural information;
[2024-06-02 21:21:13] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (847 resets) in 2209 ms. (18 steps per ms) remains 8/14 properties
FORMULA CO4-PT-20-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (135 resets) in 243 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (144 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (126 resets) in 324 ms. (123 steps per ms) remains 7/8 properties
FORMULA CO4-PT-20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (121 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (138 resets) in 374 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (145 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (140 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
// Phase 1: matrix 1212 rows 991 cols
[2024-06-02 21:21:14] [INFO ] Computed 12 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 921/961 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/961 variables, 921/967 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/961 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 25/986 variables, 4/971 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/986 variables, 25/996 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 5/991 variables, 2/998 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 5/1003 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1212/2203 variables, 991/1994 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2203 variables, 0/1994 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/2203 variables, 0/1994 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2203/2203 variables, and 1994 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1718 ms.
Refiners :[Domain max(s): 991/991 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 991/991 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem CO4-PT-20-ReachabilityCardinality-2024-02 is UNSAT
FORMULA CO4-PT-20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 921/961 variables, 6/46 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/961 variables, 921/967 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 21:21:17] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/961 variables, 1/968 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/961 variables, 0/968 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 25/986 variables, 4/972 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 25/997 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 0/997 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5/991 variables, 2/999 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 5/1004 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-02 21:21:17] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/991 variables, 1/1005 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/991 variables, 0/1005 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1212/2203 variables, 991/1996 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2203 variables, 6/2002 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2203 variables, 0/2002 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2203 variables, 0/2002 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2203/2203 variables, and 2002 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2691 ms.
Refiners :[Domain max(s): 991/991 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 991/991 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 4510ms problems are : Problem set: 1 solved, 6 unsolved
FORMULA CO4-PT-20-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-20-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 920 ms.
Support contains 6 out of 991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Graph (trivial) has 1008 edges and 991 vertex of which 3 / 991 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1661 edges and 989 vertex of which 933 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.3 ms
Discarding 56 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 635 rules applied. Total rules applied 637 place count 933 transition count 548
Reduce places removed 599 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 627 rules applied. Total rules applied 1264 place count 334 transition count 520
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 31 rules applied. Total rules applied 1295 place count 321 transition count 502
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 12 rules applied. Total rules applied 1307 place count 315 transition count 496
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 1316 place count 312 transition count 490
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 12 rules applied. Total rules applied 1328 place count 309 transition count 481
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1335 place count 303 transition count 480
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1335 place count 303 transition count 479
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1337 place count 302 transition count 479
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 1388 place count 251 transition count 428
Iterating global reduction 7 with 51 rules applied. Total rules applied 1439 place count 251 transition count 428
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1439 place count 251 transition count 414
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1467 place count 237 transition count 414
Discarding 32 places :
Symmetric choice reduction at 7 with 32 rule applications. Total rules 1499 place count 205 transition count 357
Iterating global reduction 7 with 32 rules applied. Total rules applied 1531 place count 205 transition count 357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 7 rules applied. Total rules applied 1538 place count 205 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1539 place count 204 transition count 350
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1543 place count 200 transition count 345
Iterating global reduction 9 with 4 rules applied. Total rules applied 1547 place count 200 transition count 345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1551 place count 200 transition count 341
Performed 71 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 10 with 142 rules applied. Total rules applied 1693 place count 129 transition count 261
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1696 place count 129 transition count 258
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 11 with 76 rules applied. Total rules applied 1772 place count 91 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 11 with 54 rules applied. Total rules applied 1826 place count 91 transition count 243
Discarding 25 places :
Symmetric choice reduction at 12 with 25 rule applications. Total rules 1851 place count 66 transition count 168
Iterating global reduction 12 with 25 rules applied. Total rules applied 1876 place count 66 transition count 168
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1890 place count 66 transition count 154
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1896 place count 60 transition count 127
Iterating global reduction 13 with 6 rules applied. Total rules applied 1902 place count 60 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1905 place count 60 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1907 place count 59 transition count 136
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1911 place count 59 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 15 with 10 rules applied. Total rules applied 1921 place count 59 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1923 place count 58 transition count 132
Free-agglomeration rule applied 13 times.
Iterating global reduction 15 with 13 rules applied. Total rules applied 1936 place count 58 transition count 119
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 16 rules applied. Total rules applied 1952 place count 45 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1954 place count 45 transition count 114
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1956 place count 45 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1957 place count 45 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1958 place count 45 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1959 place count 44 transition count 112
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 21 edges and 41 vertex of which 2 / 41 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 16 with 4 rules applied. Total rules applied 1963 place count 40 transition count 112
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 28 edges and 39 vertex of which 6 / 39 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 17 with 5 rules applied. Total rules applied 1968 place count 34 transition count 109
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 18 with 24 rules applied. Total rules applied 1992 place count 34 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 1994 place count 33 transition count 84
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1995 place count 32 transition count 80
Iterating global reduction 19 with 1 rules applied. Total rules applied 1996 place count 32 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1997 place count 32 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 20 with 13 rules applied. Total rules applied 2010 place count 32 transition count 66
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 2012 place count 30 transition count 60
Iterating global reduction 20 with 2 rules applied. Total rules applied 2014 place count 30 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 2016 place count 30 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 2017 place count 30 transition count 57
Free-agglomeration rule applied 5 times.
Iterating global reduction 21 with 5 rules applied. Total rules applied 2022 place count 30 transition count 52
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 21 with 5 rules applied. Total rules applied 2027 place count 25 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 2031 place count 25 transition count 48
Applied a total of 2031 rules in 179 ms. Remains 25 /991 variables (removed 966) and now considering 48/1212 (removed 1164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 25/991 places, 48/1212 transitions.
RANDOM walk for 1105 steps (0 resets) in 17 ms. (61 steps per ms) remains 0/1 properties
FORMULA CO4-PT-20-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7239 ms.
ITS solved all properties within timeout

BK_STOP 1717363280605

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

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="CO4-PT-20"
export BK_EXAMINATION="ReachabilityCardinality"
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 CO4-PT-20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734897900158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-20.tgz
mv CO4-PT-20 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;