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.r443-smll-171701110200285.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 Vasy2003-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701110200285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 207K May 18 16:43 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 Vasy2003-PT-none-UpperBounds-00
FORMULA_NAME Vasy2003-PT-none-UpperBounds-01
FORMULA_NAME Vasy2003-PT-none-UpperBounds-02
FORMULA_NAME Vasy2003-PT-none-UpperBounds-03
FORMULA_NAME Vasy2003-PT-none-UpperBounds-04
FORMULA_NAME Vasy2003-PT-none-UpperBounds-05
FORMULA_NAME Vasy2003-PT-none-UpperBounds-06
FORMULA_NAME Vasy2003-PT-none-UpperBounds-07
FORMULA_NAME Vasy2003-PT-none-UpperBounds-08
FORMULA_NAME Vasy2003-PT-none-UpperBounds-09
FORMULA_NAME Vasy2003-PT-none-UpperBounds-10
FORMULA_NAME Vasy2003-PT-none-UpperBounds-11
FORMULA_NAME Vasy2003-PT-none-UpperBounds-12
FORMULA_NAME Vasy2003-PT-none-UpperBounds-13
FORMULA_NAME Vasy2003-PT-none-UpperBounds-14
FORMULA_NAME Vasy2003-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717088888203

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 17:08:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 17:08:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:08:11] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2024-05-30 17:08:11] [INFO ] Transformed 485 places.
[2024-05-30 17:08:11] [INFO ] Transformed 776 transitions.
[2024-05-30 17:08:11] [INFO ] Found NUPN structural information;
[2024-05-30 17:08:11] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 655 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 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, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-30 17:08:11] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2024-05-30 17:08:11] [INFO ] Computed 66 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 154 ms. (64 steps per ms)
FORMULA Vasy2003-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 153 ms. (324 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-05-30 17:08:11] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
[2024-05-30 17:08:11] [INFO ] Invariant cache hit.
[2024-05-30 17:08:12] [INFO ] [Real]Absence check using 59 positive place invariants in 66 ms returned sat
[2024-05-30 17:08:12] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-30 17:08:13] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2024-05-30 17:08:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:08:13] [INFO ] [Nat]Absence check using 59 positive place invariants in 29 ms returned sat
[2024-05-30 17:08:13] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-30 17:08:13] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-05-30 17:08:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-30 17:08:14] [INFO ] [Nat]Added 73 Read/Feed constraints in 55 ms returned sat
[2024-05-30 17:08:14] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 105 ms.
[2024-05-30 17:08:14] [INFO ] Added : 33 causal constraints over 7 iterations in 557 ms. Result :sat
Minimization took 631 ms.
[2024-05-30 17:08:15] [INFO ] [Real]Absence check using 59 positive place invariants in 43 ms returned sat
[2024-05-30 17:08:15] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-30 17:08:15] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-30 17:08:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:08:16] [INFO ] [Nat]Absence check using 59 positive place invariants in 45 ms returned sat
[2024-05-30 17:08:16] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-30 17:08:16] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-05-30 17:08:16] [INFO ] [Nat]Added 73 Read/Feed constraints in 78 ms returned sat
[2024-05-30 17:08:17] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 148 ms.
[2024-05-30 17:08:17] [INFO ] Added : 30 causal constraints over 9 iterations in 916 ms. Result :sat
Minimization took 677 ms.
[2024-05-30 17:08:18] [INFO ] [Real]Absence check using 59 positive place invariants in 43 ms returned sat
[2024-05-30 17:08:18] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-30 17:08:19] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-05-30 17:08:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:08:19] [INFO ] [Nat]Absence check using 59 positive place invariants in 45 ms returned sat
[2024-05-30 17:08:19] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-30 17:08:19] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2024-05-30 17:08:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 92 ms returned sat
[2024-05-30 17:08:20] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 88 ms.
[2024-05-30 17:08:20] [INFO ] Added : 36 causal constraints over 8 iterations in 800 ms. Result :sat
Minimization took 683 ms.
[2024-05-30 17:08:21] [INFO ] [Real]Absence check using 59 positive place invariants in 41 ms returned sat
[2024-05-30 17:08:21] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-30 17:08:22] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-30 17:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:08:22] [INFO ] [Nat]Absence check using 59 positive place invariants in 44 ms returned sat
[2024-05-30 17:08:22] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-30 17:08:22] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2024-05-30 17:08:23] [INFO ] [Nat]Added 73 Read/Feed constraints in 79 ms returned sat
[2024-05-30 17:08:23] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 85 ms.
[2024-05-30 17:08:23] [INFO ] Added : 39 causal constraints over 8 iterations in 763 ms. Result :sat
Minimization took 590 ms.
[2024-05-30 17:08:24] [INFO ] [Real]Absence check using 59 positive place invariants in 41 ms returned sat
[2024-05-30 17:08:24] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-30 17:08:25] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-05-30 17:08:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:08:25] [INFO ] [Nat]Absence check using 59 positive place invariants in 42 ms returned sat
[2024-05-30 17:08:25] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-30 17:08:25] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2024-05-30 17:08:25] [INFO ] [Nat]Added 73 Read/Feed constraints in 95 ms returned sat
[2024-05-30 17:08:26] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 93 ms.
[2024-05-30 17:08:26] [INFO ] Added : 38 causal constraints over 8 iterations in 639 ms. Result :sat
Minimization took 622 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 157 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1555 edges and 483 vertex of which 413 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.7 ms
Discarding 70 places :
Also discarding 55 output transitions
Drop transitions (Output transitions of discarded places.) removed 55 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 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 0 with 20 rules applied. Total rules applied 22 place count 413 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 412 transition count 669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 23 place count 412 transition count 654
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 53 place count 397 transition count 654
Discarding 133 places :
Symmetric choice reduction at 2 with 133 rule applications. Total rules 186 place count 264 transition count 521
Ensure Unique test removed 1 places
Iterating global reduction 2 with 134 rules applied. Total rules applied 320 place count 263 transition count 521
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 351 place count 263 transition count 490
Discarding 93 places :
Symmetric choice reduction at 3 with 93 rule applications. Total rules 444 place count 170 transition count 372
Iterating global reduction 3 with 93 rules applied. Total rules applied 537 place count 170 transition count 372
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 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 67 rules applied. Total rules applied 604 place count 170 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 605 place count 169 transition count 305
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 642 place count 132 transition count 238
Iterating global reduction 5 with 37 rules applied. Total rules applied 679 place count 132 transition count 238
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 711 place count 132 transition count 206
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 712 place count 131 transition count 200
Iterating global reduction 6 with 1 rules applied. Total rules applied 713 place count 131 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 714 place count 131 transition count 199
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 715 place count 130 transition count 198
Iterating global reduction 7 with 1 rules applied. Total rules applied 716 place count 130 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 718 place count 130 transition count 196
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 734 place count 122 transition count 188
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 737 place count 119 transition count 184
Iterating global reduction 8 with 3 rules applied. Total rules applied 740 place count 119 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 742 place count 119 transition count 182
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 744 place count 117 transition count 179
Iterating global reduction 9 with 2 rules applied. Total rules applied 746 place count 117 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 749 place count 117 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 755 place count 117 transition count 170
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 757 place count 117 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 759 place count 115 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 760 place count 114 transition count 167
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 16 edges and 106 vertex of which 4 / 106 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 11 with 13 rules applied. Total rules applied 773 place count 104 transition count 163
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 777 place count 104 transition count 159
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 5 Pre rules applied. Total rules applied 777 place count 104 transition count 154
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 15 rules applied. Total rules applied 792 place count 94 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 795 place count 94 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 2 Pre rules applied. Total rules applied 795 place count 94 transition count 149
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 5 rules applied. Total rules applied 800 place count 91 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 800 place count 91 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 803 place count 89 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 804 place count 89 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 810 place count 85 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 810 place count 85 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 812 place count 84 transition count 144
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 814 place count 82 transition count 142
Iterating global reduction 15 with 2 rules applied. Total rules applied 816 place count 82 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 822 place count 79 transition count 139
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 832 place count 79 transition count 129
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 833 place count 78 transition count 127
Iterating global reduction 16 with 1 rules applied. Total rules applied 834 place count 78 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 838 place count 78 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 840 place count 78 transition count 121
Free-agglomeration rule applied 7 times.
Iterating global reduction 17 with 7 rules applied. Total rules applied 847 place count 78 transition count 114
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 15 rules applied. Total rules applied 862 place count 69 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 862 place count 69 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 3 rules applied. Total rules applied 865 place count 67 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 865 place count 67 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 3 rules applied. Total rules applied 868 place count 65 transition count 106
Graph (trivial) has 9 edges and 65 vertex of which 2 / 65 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 870 place count 63 transition count 106
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 873 place count 63 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 875 place count 63 transition count 101
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 876 place count 63 transition count 100
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 880 place count 61 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 882 place count 60 transition count 97
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 883 place count 60 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 884 place count 59 transition count 99
Applied a total of 884 rules in 462 ms. Remains 59 /485 variables (removed 426) and now considering 99/752 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 59/485 places, 99/752 transitions.
[2024-05-30 17:08:27] [INFO ] Flow matrix only has 85 transitions (discarded 14 similar events)
// Phase 1: matrix 85 rows 59 cols
[2024-05-30 17:08:27] [INFO ] Computed 13 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1531 ms. (652 steps per ms)
FORMULA Vasy2003-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 357 ms. (2793 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 18989 ms.
ITS solved all properties within timeout

BK_STOP 1717088909718

--------------------
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="Vasy2003-PT-none"
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 Vasy2003-PT-none, 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 r443-smll-171701110200285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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