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

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 22:47:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 22:47:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 22:47:28] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2024-06-01 22:47:28] [INFO ] Transformed 485 places.
[2024-06-01 22:47:28] [INFO ] Transformed 776 transitions.
[2024-06-01 22:47:28] [INFO ] Found NUPN structural information;
[2024-06-01 22:47:28] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 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-06-01 22:47:28] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2024-06-01 22:47:28] [INFO ] Computed 66 invariants in 45 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 112 ms. (88 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-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Vasy2003-PT-none-UpperBounds-06 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 70007 steps (14 resets) in 146 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-01 22:47:28] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
[2024-06-01 22:47:28] [INFO ] Invariant cache hit.
[2024-06-01 22:47:29] [INFO ] [Real]Absence check using 59 positive place invariants in 40 ms returned sat
[2024-06-01 22:47:29] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 22:47:30] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-06-01 22:47:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:30] [INFO ] [Nat]Absence check using 59 positive place invariants in 45 ms returned sat
[2024-06-01 22:47:30] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2024-06-01 22:47:30] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2024-06-01 22:47:30] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-01 22:47:30] [INFO ] [Nat]Added 73 Read/Feed constraints in 76 ms returned sat
[2024-06-01 22:47:31] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 102 ms.
[2024-06-01 22:47:31] [INFO ] Added : 15 causal constraints over 3 iterations in 389 ms. Result :sat
Minimization took 597 ms.
[2024-06-01 22:47:32] [INFO ] [Real]Absence check using 59 positive place invariants in 37 ms returned sat
[2024-06-01 22:47:32] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2024-06-01 22:47:32] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-06-01 22:47:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:32] [INFO ] [Nat]Absence check using 59 positive place invariants in 34 ms returned sat
[2024-06-01 22:47:32] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2024-06-01 22:47:33] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2024-06-01 22:47:33] [INFO ] [Nat]Added 73 Read/Feed constraints in 56 ms returned sat
[2024-06-01 22:47:33] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 97 ms.
[2024-06-01 22:47:33] [INFO ] Added : 33 causal constraints over 7 iterations in 584 ms. Result :sat
Minimization took 594 ms.
[2024-06-01 22:47:34] [INFO ] [Real]Absence check using 59 positive place invariants in 31 ms returned sat
[2024-06-01 22:47:34] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 22:47:34] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2024-06-01 22:47:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:35] [INFO ] [Nat]Absence check using 59 positive place invariants in 34 ms returned sat
[2024-06-01 22:47:35] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 13 ms returned sat
[2024-06-01 22:47:35] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2024-06-01 22:47:35] [INFO ] [Nat]Added 73 Read/Feed constraints in 58 ms returned sat
[2024-06-01 22:47:35] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 62 ms.
[2024-06-01 22:47:36] [INFO ] Added : 30 causal constraints over 9 iterations in 582 ms. Result :sat
Minimization took 603 ms.
[2024-06-01 22:47:36] [INFO ] [Real]Absence check using 59 positive place invariants in 28 ms returned sat
[2024-06-01 22:47:36] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2024-06-01 22:47:37] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-06-01 22:47:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:37] [INFO ] [Nat]Absence check using 59 positive place invariants in 31 ms returned sat
[2024-06-01 22:47:37] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2024-06-01 22:47:37] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-06-01 22:47:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 77 ms returned sat
[2024-06-01 22:47:38] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 64 ms.
[2024-06-01 22:47:38] [INFO ] Added : 36 causal constraints over 8 iterations in 592 ms. Result :sat
Minimization took 593 ms.
[2024-06-01 22:47:39] [INFO ] [Real]Absence check using 59 positive place invariants in 31 ms returned sat
[2024-06-01 22:47:39] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 22:47:39] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-06-01 22:47:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:39] [INFO ] [Nat]Absence check using 59 positive place invariants in 29 ms returned sat
[2024-06-01 22:47:39] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2024-06-01 22:47:40] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-06-01 22:47:40] [INFO ] [Nat]Added 73 Read/Feed constraints in 59 ms returned sat
[2024-06-01 22:47:40] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 72 ms.
[2024-06-01 22:47:40] [INFO ] Added : 21 causal constraints over 5 iterations in 444 ms. Result :sat
Minimization took 580 ms.
[2024-06-01 22:47:41] [INFO ] [Real]Absence check using 59 positive place invariants in 30 ms returned sat
[2024-06-01 22:47:41] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 22:47:41] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-06-01 22:47:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:42] [INFO ] [Nat]Absence check using 59 positive place invariants in 32 ms returned sat
[2024-06-01 22:47:42] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 6 ms returned sat
[2024-06-01 22:47:42] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2024-06-01 22:47:42] [INFO ] [Nat]Added 73 Read/Feed constraints in 55 ms returned sat
[2024-06-01 22:47:42] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 63 ms.
[2024-06-01 22:47:42] [INFO ] Added : 39 causal constraints over 8 iterations in 553 ms. Result :sat
Minimization took 582 ms.
[2024-06-01 22:47:43] [INFO ] [Real]Absence check using 59 positive place invariants in 31 ms returned sat
[2024-06-01 22:47:43] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2024-06-01 22:47:44] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-06-01 22:47:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 22:47:44] [INFO ] [Nat]Absence check using 59 positive place invariants in 30 ms returned sat
[2024-06-01 22:47:44] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2024-06-01 22:47:44] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2024-06-01 22:47:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 70 ms returned sat
[2024-06-01 22:47:44] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 65 ms.
[2024-06-01 22:47:45] [INFO ] Added : 38 causal constraints over 8 iterations in 517 ms. Result :sat
Minimization took 594 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 155 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 6 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.5 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 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 23 place count 412 transition count 655
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 51 place count 398 transition count 655
Discarding 131 places :
Symmetric choice reduction at 2 with 131 rule applications. Total rules 182 place count 267 transition count 524
Ensure Unique test removed 1 places
Iterating global reduction 2 with 132 rules applied. Total rules applied 314 place count 266 transition count 524
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 345 place count 266 transition count 493
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 435 place count 176 transition count 379
Iterating global reduction 3 with 90 rules applied. Total rules applied 525 place count 176 transition count 379
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 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 62 rules applied. Total rules applied 587 place count 176 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 588 place count 175 transition count 317
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 625 place count 138 transition count 251
Iterating global reduction 5 with 37 rules applied. Total rules applied 662 place count 138 transition count 251
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 691 place count 138 transition count 222
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 693 place count 136 transition count 219
Iterating global reduction 6 with 2 rules applied. Total rules applied 695 place count 136 transition count 219
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 713 place count 127 transition count 210
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 716 place count 124 transition count 206
Iterating global reduction 6 with 3 rules applied. Total rules applied 719 place count 124 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 723 place count 124 transition count 202
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 725 place count 122 transition count 199
Iterating global reduction 7 with 2 rules applied. Total rules applied 727 place count 122 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 733 place count 122 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 741 place count 122 transition count 185
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 744 place count 122 transition count 182
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 753 place count 119 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 754 place count 118 transition count 175
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 110 vertex of which 4 / 110 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 13 rules applied. Total rules applied 767 place count 108 transition count 171
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 771 place count 108 transition count 167
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 771 place count 108 transition count 162
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 15 rules applied. Total rules applied 786 place count 98 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 789 place count 98 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 789 place count 98 transition count 157
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 5 rules applied. Total rules applied 794 place count 95 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 794 place count 95 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 797 place count 93 transition count 156
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 798 place count 93 transition count 155
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 4 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 804 place count 89 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 804 place count 89 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 806 place count 88 transition count 152
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 808 place count 86 transition count 150
Iterating global reduction 13 with 2 rules applied. Total rules applied 810 place count 86 transition count 150
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 13 with 6 rules applied. Total rules applied 816 place count 83 transition count 147
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 826 place count 83 transition count 137
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 827 place count 82 transition count 135
Iterating global reduction 14 with 1 rules applied. Total rules applied 828 place count 82 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 832 place count 82 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 834 place count 82 transition count 129
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 842 place count 82 transition count 121
Reduce places removed 10 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 15 with 16 rules applied. Total rules applied 858 place count 72 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 858 place count 72 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 861 place count 70 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 861 place count 70 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 864 place count 68 transition count 113
Graph (trivial) has 9 edges and 68 vertex of which 2 / 68 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 866 place count 66 transition count 113
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 869 place count 66 transition count 110
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 871 place count 66 transition count 108
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 872 place count 66 transition count 107
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 17 with 4 rules applied. Total rules applied 876 place count 64 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 878 place count 63 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 879 place count 63 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 880 place count 62 transition count 106
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 882 place count 62 transition count 104
Applied a total of 882 rules in 298 ms. Remains 62 /485 variables (removed 423) and now considering 104/752 (removed 648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 62/485 places, 104/752 transitions.
[2024-06-01 22:47:46] [INFO ] Flow matrix only has 90 transitions (discarded 14 similar events)
// Phase 1: matrix 90 rows 62 cols
[2024-06-01 22:47:46] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1326 ms. (753 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-08 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
FORMULA Vasy2003-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 449 ms. (2222 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 19916 ms.
ITS solved all properties within timeout

BK_STOP 1717282068024

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r544-smll-171701111200285"
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 ;