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-171734897700069.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-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897700069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 152K 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-09-UpperBounds-00
FORMULA_NAME CO4-PT-09-UpperBounds-01
FORMULA_NAME CO4-PT-09-UpperBounds-02
FORMULA_NAME CO4-PT-09-UpperBounds-03
FORMULA_NAME CO4-PT-09-UpperBounds-04
FORMULA_NAME CO4-PT-09-UpperBounds-05
FORMULA_NAME CO4-PT-09-UpperBounds-06
FORMULA_NAME CO4-PT-09-UpperBounds-07
FORMULA_NAME CO4-PT-09-UpperBounds-08
FORMULA_NAME CO4-PT-09-UpperBounds-09
FORMULA_NAME CO4-PT-09-UpperBounds-10
FORMULA_NAME CO4-PT-09-UpperBounds-11
FORMULA_NAME CO4-PT-09-UpperBounds-12
FORMULA_NAME CO4-PT-09-UpperBounds-13
FORMULA_NAME CO4-PT-09-UpperBounds-14
FORMULA_NAME CO4-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717352829155

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:27:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:27:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:27:10] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 18:27:10] [INFO ] Transformed 467 places.
[2024-06-02 18:27:10] [INFO ] Transformed 634 transitions.
[2024-06-02 18:27:10] [INFO ] Found NUPN structural information;
[2024-06-02 18:27:10] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 471 rows 359 cols
[2024-06-02 18:27:10] [INFO ] Computed 9 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (354 resets) in 39 ms. (250 steps per ms)
FORMULA CO4-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (265 resets) in 54 ms. (909 steps per ms)
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:27:10] [INFO ] Invariant cache hit.
[2024-06-02 18:27:10] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 18:27:11] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 26 ms returned sat
[2024-06-02 18:27:11] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-06-02 18:27:11] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 11 ms to minimize.
[2024-06-02 18:27:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:27:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 18:27:11] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:27:11] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-06-02 18:27:11] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-06-02 18:27:11] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 41 ms.
[2024-06-02 18:27:12] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:27:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2024-06-02 18:27:12] [INFO ] Added : 70 causal constraints over 16 iterations in 699 ms. Result :sat
Minimization took 197 ms.
[2024-06-02 18:27:12] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:27:12] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:27:12] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-06-02 18:27:12] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 30 ms.
[2024-06-02 18:27:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:27:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:27:13] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:27:13] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-06-02 18:27:13] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 34 ms.
[2024-06-02 18:27:13] [INFO ] Added : 50 causal constraints over 10 iterations in 320 ms. Result :sat
Minimization took 178 ms.
[2024-06-02 18:27:13] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:27:13] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:27:14] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-06-02 18:27:14] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 32 ms.
[2024-06-02 18:27:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:27:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:27:14] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:27:14] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-06-02 18:27:14] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 26 ms.
[2024-06-02 18:27:14] [INFO ] Added : 41 causal constraints over 9 iterations in 289 ms. Result :sat
Minimization took 181 ms.
[2024-06-02 18:27:14] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 18:27:14] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:27:15] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-06-02 18:27:15] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 30 ms.
[2024-06-02 18:27:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:27:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:27:15] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:27:15] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-06-02 18:27:15] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 24 ms.
[2024-06-02 18:27:15] [INFO ] Added : 28 causal constraints over 6 iterations in 212 ms. Result :sat
Minimization took 189 ms.
[2024-06-02 18:27:15] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 18:27:15] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:27:16] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-06-02 18:27:16] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 28 ms.
[2024-06-02 18:27:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:27:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:27:16] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:27:16] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-06-02 18:27:16] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 27 ms.
[2024-06-02 18:27:16] [INFO ] Added : 30 causal constraints over 6 iterations in 209 ms. Result :sat
Minimization took 200 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-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 471/471 transitions.
Graph (trivial) has 355 edges and 359 vertex of which 2 / 359 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 757 edges and 358 vertex of which 323 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 180 rules applied. Total rules applied 182 place count 323 transition count 272
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 172 rules applied. Total rules applied 354 place count 165 transition count 258
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 16 rules applied. Total rules applied 370 place count 159 transition count 248
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 377 place count 154 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 377 place count 154 transition count 245
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 379 place count 153 transition count 245
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 404 place count 128 transition count 220
Iterating global reduction 4 with 25 rules applied. Total rules applied 429 place count 128 transition count 220
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 429 place count 128 transition count 215
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 439 place count 123 transition count 215
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 456 place count 106 transition count 173
Iterating global reduction 4 with 17 rules applied. Total rules applied 473 place count 106 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 475 place count 106 transition count 171
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 477 place count 104 transition count 169
Iterating global reduction 5 with 2 rules applied. Total rules applied 479 place count 104 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 481 place count 104 transition count 167
Performed 39 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 559 place count 65 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 561 place count 65 transition count 120
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 593 place count 49 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 601 place count 49 transition count 129
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 612 place count 38 transition count 85
Iterating global reduction 8 with 11 rules applied. Total rules applied 623 place count 38 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 631 place count 38 transition count 77
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 634 place count 35 transition count 59
Iterating global reduction 9 with 3 rules applied. Total rules applied 637 place count 35 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 639 place count 35 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 641 place count 34 transition count 64
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 644 place count 34 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 652 place count 34 transition count 53
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 661 place count 34 transition count 44
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 671 place count 25 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 672 place count 24 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 674 place count 22 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 680 place count 22 transition count 36
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 682 place count 20 transition count 32
Iterating global reduction 13 with 2 rules applied. Total rules applied 684 place count 20 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 686 place count 20 transition count 30
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 687 place count 19 transition count 28
Iterating global reduction 14 with 1 rules applied. Total rules applied 688 place count 19 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 689 place count 19 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 690 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 691 place count 18 transition count 26
Applied a total of 691 rules in 98 ms. Remains 18 /359 variables (removed 341) and now considering 26/471 (removed 445) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 18/359 places, 26/471 transitions.
// Phase 1: matrix 26 rows 18 cols
[2024-06-02 18:27:17] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 705 ms. (1416 steps per ms)
FORMULA CO4-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 262 ms. (3802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 7851 ms.
ITS solved all properties within timeout

BK_STOP 1717352838196

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-09"
export BK_EXAMINATION="UpperBounds"
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-09, 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 r549-tall-171734897700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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