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.r571-tall-171734910100051.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 gold2023
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 r571-tall-171734910100051
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:23] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-06-02 22:51:23] [INFO ] Transformed 545 places.
[2024-06-02 22:51:23] [INFO ] Transformed 617 transitions.
[2024-06-02 22:51:23] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:23] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 157 places in 7 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
FORMULA CO4-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 440 rows 388 cols
[2024-06-02 22:51:23] [INFO ] Computed 6 invariants in 24 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :1
FORMULA CO4-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
FORMULA CO4-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
[2024-06-02 22:51:23] [INFO ] Invariant cache hit.
[2024-06-02 22:51:23] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2024-06-02 22:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:24] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-02 22:51:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:24] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-06-02 22:51:24] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 30 ms.
[2024-06-02 22:51:24] [INFO ] Added : 77 causal constraints over 16 iterations in 481 ms. Result :sat
Minimization took 48 ms.
[2024-06-02 22:51:25] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:25] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-06-02 22:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:25] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-06-02 22:51:25] [INFO ] Deduced a trap composed of 257 places in 107 ms of which 4 ms to minimize.
[2024-06-02 22:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-06-02 22:51:25] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 33 ms.
[2024-06-02 22:51:25] [INFO ] Added : 76 causal constraints over 16 iterations in 467 ms. Result :sat
Minimization took 48 ms.
[2024-06-02 22:51:26] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:26] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-02 22:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:26] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-02 22:51:26] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 25 ms.
[2024-06-02 22:51:26] [INFO ] Added : 37 causal constraints over 9 iterations in 264 ms. Result :sat
Minimization took 40 ms.
[2024-06-02 22:51:26] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:26] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-06-02 22:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:27] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-02 22:51:27] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 29 ms.
[2024-06-02 22:51:27] [INFO ] Added : 62 causal constraints over 13 iterations in 373 ms. Result :sat
Minimization took 58 ms.
[2024-06-02 22:51:27] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:27] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-02 22:51:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:28] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-06-02 22:51:28] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 31 ms.
[2024-06-02 22:51:28] [INFO ] Added : 70 causal constraints over 14 iterations in 410 ms. Result :sat
Minimization took 53 ms.
[2024-06-02 22:51:28] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:28] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-02 22:51:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:28] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-06-02 22:51:28] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 25 ms.
[2024-06-02 22:51:29] [INFO ] Added : 56 causal constraints over 12 iterations in 348 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
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-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 388 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 439/439 transitions.
Graph (trivial) has 392 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 removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 532 edges and 386 vertex of which 352 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 247 rules applied. Total rules applied 249 place count 351 transition count 170
Reduce places removed 228 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 237 rules applied. Total rules applied 486 place count 123 transition count 160
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions 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 496 place count 119 transition count 154
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions 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 500 place count 117 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions 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 503 place count 116 transition count 150
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 505 place count 115 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 505 place count 115 transition count 148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 507 place count 114 transition count 148
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 525 place count 96 transition count 130
Iterating global reduction 6 with 18 rules applied. Total rules applied 543 place count 96 transition count 130
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 543 place count 96 transition count 124
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 555 place count 90 transition count 124
Graph (complete) has 163 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 556 place count 88 transition count 123
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 559 place count 88 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 560 place count 87 transition count 120
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 571 place count 76 transition count 109
Iterating global reduction 9 with 11 rules applied. Total rules applied 582 place count 76 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 583 place count 76 transition count 108
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 584 place count 75 transition count 107
Iterating global reduction 10 with 1 rules applied. Total rules applied 585 place count 75 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 586 place count 75 transition count 106
Performed 31 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 62 rules applied. Total rules applied 648 place count 44 transition count 71
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 652 place count 44 transition count 67
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 655 place count 41 transition count 64
Iterating global reduction 12 with 3 rules applied. Total rules applied 658 place count 41 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 659 place count 41 transition count 63
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 13 with 4 rules applied. Total rules applied 663 place count 39 transition count 61
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 665 place count 39 transition count 59
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 667 place count 37 transition count 57
Iterating global reduction 14 with 2 rules applied. Total rules applied 669 place count 37 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 670 place count 37 transition count 56
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 671 place count 36 transition count 55
Iterating global reduction 15 with 1 rules applied. Total rules applied 672 place count 36 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 673 place count 36 transition count 54
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 16 with 18 rules applied. Total rules applied 691 place count 27 transition count 55
Drop transitions removed 9 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 708 place count 27 transition count 38
Discarding 8 places :
Symmetric choice reduction at 17 with 8 rule applications. Total rules 716 place count 19 transition count 30
Iterating global reduction 17 with 8 rules applied. Total rules applied 724 place count 19 transition count 30
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 732 place count 19 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 733 place count 19 transition count 21
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 734 place count 18 transition count 20
Iterating global reduction 18 with 1 rules applied. Total rules applied 735 place count 18 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 736 place count 18 transition count 19
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 740 place count 18 transition count 15
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 745 place count 14 transition count 14
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 746 place count 14 transition count 14
Graph (complete) has 29 edges and 14 vertex of which 13 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 20 with 1 rules applied. Total rules applied 747 place count 13 transition count 14
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 748 place count 13 transition count 13
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 749 place count 13 transition count 13
Graph (complete) has 26 edges and 13 vertex of which 12 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 22 with 1 rules applied. Total rules applied 750 place count 12 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 751 place count 12 transition count 12
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 752 place count 12 transition count 12
Graph (complete) has 23 edges and 12 vertex of which 11 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 24 with 1 rules applied. Total rules applied 753 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 754 place count 11 transition count 11
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 755 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 756 place count 10 transition count 10
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions 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 removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 758 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 7 edges and 6 vertex of which 4 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 27 with 2 rules applied. Total rules applied 760 place count 3 transition count 8
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 28 with 6 rules applied. Total rules applied 766 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 29 with 1 Pre rules applied. Total rules applied 766 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 768 place count 2 transition count 1
Applied a total of 768 rules in 77 ms. Remains 2 /388 variables (removed 386) and now considering 1/439 (removed 438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2/388 places, 1/439 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-06-02 22:51:29] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 273 ms. (steps per millisecond=3663 ) properties (out of 1) seen :1
FORMULA CO4-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6462 ms.

BK_STOP 1717368691180

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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 gold2023"
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 r571-tall-171734910100051"
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 ;