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.r553-tall-171734900900085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CO4-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900900085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 132K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-11-UpperBounds-00
FORMULA_NAME CO4-PT-11-UpperBounds-01
FORMULA_NAME CO4-PT-11-UpperBounds-02
FORMULA_NAME CO4-PT-11-UpperBounds-03
FORMULA_NAME CO4-PT-11-UpperBounds-04
FORMULA_NAME CO4-PT-11-UpperBounds-05
FORMULA_NAME CO4-PT-11-UpperBounds-06
FORMULA_NAME CO4-PT-11-UpperBounds-07
FORMULA_NAME CO4-PT-11-UpperBounds-08
FORMULA_NAME CO4-PT-11-UpperBounds-09
FORMULA_NAME CO4-PT-11-UpperBounds-10
FORMULA_NAME CO4-PT-11-UpperBounds-11
FORMULA_NAME CO4-PT-11-UpperBounds-12
FORMULA_NAME CO4-PT-11-UpperBounds-13
FORMULA_NAME CO4-PT-11-UpperBounds-14
FORMULA_NAME CO4-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717351595277

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:06:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:06:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:36] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 18:06:36] [INFO ] Transformed 545 places.
[2024-06-02 18:06:36] [INFO ] Transformed 617 transitions.
[2024-06-02 18:06:36] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:36] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 440 rows 388 cols
[2024-06-02 18:06:36] [INFO ] Computed 6 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (5 resets) in 26 ms. (370 steps per ms)
FORMULA CO4-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70000 steps (80 resets) in 83 ms. (833 steps per ms)
FORMULA CO4-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 18:06:36] [INFO ] Invariant cache hit.
[2024-06-02 18:06:37] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-06-02 18:06:37] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-02 18:06:37] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 35 ms.
[2024-06-02 18:06:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:37] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-02 18:06:37] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 28 ms.
[2024-06-02 18:06:38] [INFO ] Added : 77 causal constraints over 16 iterations in 475 ms. Result :sat
Minimization took 218 ms.
[2024-06-02 18:06:38] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:38] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-06-02 18:06:38] [INFO ] Deduced a trap composed of 257 places in 138 ms of which 24 ms to minimize.
[2024-06-02 18:06:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:39] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-06-02 18:06:39] [INFO ] Deduced a trap composed of 257 places in 118 ms of which 3 ms to minimize.
[2024-06-02 18:06:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-06-02 18:06:39] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 26 ms.
[2024-06-02 18:06:39] [INFO ] Added : 79 causal constraints over 16 iterations in 447 ms. Result :sat
Minimization took 130 ms.
[2024-06-02 18:06:39] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:06:40] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-06-02 18:06:40] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 21 ms.
[2024-06-02 18:06:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:06:40] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-06-02 18:06:40] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 32 ms.
[2024-06-02 18:06:40] [INFO ] Added : 56 causal constraints over 12 iterations in 341 ms. Result :sat
Minimization took 142 ms.
[2024-06-02 18:06:40] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:06:41] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-06-02 18:06:41] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 3 ms to minimize.
[2024-06-02 18:06:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:41] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-02 18:06:41] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:06:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-06-02 18:06:41] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 29 ms.
[2024-06-02 18:06:41] [INFO ] Added : 68 causal constraints over 14 iterations in 393 ms. Result :sat
Minimization took 129 ms.
[2024-06-02 18:06:42] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 18:06:42] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 18:06:42] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 24 ms.
[2024-06-02 18:06:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 18:06:42] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-06-02 18:06:42] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 24 ms.
[2024-06-02 18:06:42] [INFO ] Added : 64 causal constraints over 13 iterations in 378 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA CO4-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 440/440 transitions.
Graph (trivial) has 391 edges and 388 vertex of which 3 / 388 are part of one of the 1 SCC in 4 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 533 edges and 386 vertex of which 356 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 356 transition count 174
Reduce places removed 229 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 238 rules applied. Total rules applied 490 place count 127 transition count 165
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 500 place count 123 transition count 159
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 4 rules applied. Total rules applied 504 place count 121 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 3 rules applied. Total rules applied 507 place count 120 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 509 place count 119 transition count 154
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 527 place count 101 transition count 136
Iterating global reduction 6 with 18 rules applied. Total rules applied 545 place count 101 transition count 136
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 545 place count 101 transition count 130
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 557 place count 95 transition count 130
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 568 place count 84 transition count 119
Iterating global reduction 6 with 11 rules applied. Total rules applied 579 place count 84 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 580 place count 84 transition count 118
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 581 place count 83 transition count 117
Iterating global reduction 7 with 1 rules applied. Total rules applied 582 place count 83 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 583 place count 83 transition count 116
Performed 34 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 651 place count 49 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 655 place count 49 transition count 74
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 659 place count 45 transition count 70
Iterating global reduction 9 with 4 rules applied. Total rules applied 663 place count 45 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 664 place count 45 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 668 place count 43 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 670 place count 43 transition count 65
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 672 place count 41 transition count 63
Iterating global reduction 11 with 2 rules applied. Total rules applied 674 place count 41 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 675 place count 41 transition count 62
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 676 place count 40 transition count 61
Iterating global reduction 12 with 1 rules applied. Total rules applied 677 place count 40 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 678 place count 40 transition count 60
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 20 rules applied. Total rules applied 698 place count 30 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 13 with 18 rules applied. Total rules applied 716 place count 30 transition count 43
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 724 place count 22 transition count 35
Iterating global reduction 14 with 8 rules applied. Total rules applied 732 place count 22 transition count 35
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 740 place count 22 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 741 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 742 place count 21 transition count 25
Iterating global reduction 15 with 1 rules applied. Total rules applied 743 place count 21 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 744 place count 21 transition count 24
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 748 place count 21 transition count 20
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 753 place count 17 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 754 place count 17 transition count 19
Graph (complete) has 37 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 755 place count 16 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 756 place count 16 transition count 18
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 757 place count 16 transition count 18
Graph (complete) has 34 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 758 place count 15 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 759 place count 15 transition count 17
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 760 place count 15 transition count 17
Graph (complete) has 31 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 1 rules applied. Total rules applied 761 place count 14 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 762 place count 14 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 763 place count 14 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 764 place count 13 transition count 15
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t131.t132.t559 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 766 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 9 vertex of which 4 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
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 24 with 3 rules applied. Total rules applied 769 place count 6 transition count 12
Reduce places removed 1 places and 0 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 25 with 8 rules applied. Total rules applied 777 place count 5 transition count 5
Free-agglomeration rule applied 2 times.
Iterating global reduction 26 with 2 rules applied. Total rules applied 779 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 781 place count 3 transition count 3
Applied a total of 781 rules in 99 ms. Remains 3 /388 variables (removed 385) and now considering 3/440 (removed 437) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 3/388 places, 3/440 transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-02 18:06:43] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA CO4-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (250081 resets) in 271 ms. (3676 steps per ms)
FORMULA CO4-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 350 ms. (2849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7489 ms.
ITS solved all properties within timeout

BK_STOP 1717351603986

--------------------
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 UpperBounds -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-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CO4-PT-11, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734900900085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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