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.r496-tall-171640602500045.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 FlexibleBarrier-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 241K May 18 16:42 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 FlexibleBarrier-PT-08b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717182028166

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:00:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 19:00:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:00:29] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-31 19:00:29] [INFO ] Transformed 920 places.
[2024-05-31 19:00:29] [INFO ] Transformed 1057 transitions.
[2024-05-31 19:00:29] [INFO ] Found NUPN structural information;
[2024-05-31 19:00:29] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
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]
// Phase 1: matrix 1057 rows 920 cols
[2024-05-31 19:00:29] [INFO ] Computed 10 invariants in 37 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 (156 resets) in 48 ms. (204 steps per ms)
FORMULA FlexibleBarrier-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (176 resets) in 78 ms. (1139 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 19:00:29] [INFO ] Invariant cache hit.
[2024-05-31 19:00:30] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-05-31 19:00:30] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-05-31 19:00:30] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 24 ms to minimize.
[2024-05-31 19:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:00:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-31 19:00:31] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2024-05-31 19:00:31] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-31 19:00:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-05-31 19:00:31] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 70 ms.
[2024-05-31 19:00:35] [INFO ] Deduced a trap composed of 284 places in 187 ms of which 4 ms to minimize.
[2024-05-31 19:00:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-05-31 19:00:35] [INFO ] Added : 306 causal constraints over 62 iterations in 3779 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 19:00:35] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-31 19:00:36] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2024-05-31 19:00:36] [INFO ] Deduced a trap composed of 284 places in 242 ms of which 8 ms to minimize.
[2024-05-31 19:00:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:00:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2024-05-31 19:00:36] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-31 19:00:37] [INFO ] Deduced a trap composed of 284 places in 244 ms of which 5 ms to minimize.
[2024-05-31 19:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2024-05-31 19:00:37] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 63 ms.
[2024-05-31 19:00:40] [INFO ] Added : 287 causal constraints over 58 iterations in 3166 ms. Result :sat
Minimization took 507 ms.
[2024-05-31 19:00:41] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-31 19:00:41] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-05-31 19:00:41] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 59 ms.
[2024-05-31 19:00:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:00:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2024-05-31 19:00:42] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2024-05-31 19:00:42] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 57 ms.
[2024-05-31 19:00:45] [INFO ] Added : 300 causal constraints over 60 iterations in 3297 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 19:00:45] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-31 19:00:46] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2024-05-31 19:00:46] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:00:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:00:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-31 19:00:46] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2024-05-31 19:00:47] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:00:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-31 19:00:47] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 50 ms.
[2024-05-31 19:00:50] [INFO ] Deduced a trap composed of 290 places in 157 ms of which 3 ms to minimize.
[2024-05-31 19:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-31 19:00:50] [INFO ] Added : 292 causal constraints over 60 iterations in 3500 ms. Result :sat
Minimization took 501 ms.
[2024-05-31 19:00:51] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-31 19:00:51] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-05-31 19:00:51] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 58 ms.
[2024-05-31 19:00:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:00:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-31 19:00:52] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2024-05-31 19:00:52] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 64 ms.
[2024-05-31 19:00:55] [INFO ] Added : 300 causal constraints over 60 iterations in 3351 ms. Result :sat
Minimization took 509 ms.
[2024-05-31 19:00:56] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-31 19:00:56] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-05-31 19:00:56] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 51 ms.
[2024-05-31 19:00:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:00:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-31 19:00:57] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-05-31 19:00:57] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 58 ms.
[2024-05-31 19:01:00] [INFO ] Added : 300 causal constraints over 60 iterations in 3253 ms. Result :sat
Minimization took 500 ms.
[2024-05-31 19:01:01] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2024-05-31 19:01:01] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-05-31 19:01:01] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 47 ms.
[2024-05-31 19:01:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:01:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-31 19:01:02] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-31 19:01:02] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 68 ms.
[2024-05-31 19:01:05] [INFO ] Added : 315 causal constraints over 63 iterations in 3400 ms. Result :sat
Minimization took 500 ms.
[2024-05-31 19:01:06] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-31 19:01:06] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-05-31 19:01:07] [INFO ] Deduced a trap composed of 291 places in 235 ms of which 4 ms to minimize.
[2024-05-31 19:01:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:01:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2024-05-31 19:01:07] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2024-05-31 19:01:07] [INFO ] Deduced a trap composed of 291 places in 230 ms of which 4 ms to minimize.
[2024-05-31 19:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2024-05-31 19:01:07] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 51 ms.
[2024-05-31 19:01:11] [INFO ] Deduced a trap composed of 281 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:01:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-31 19:01:11] [INFO ] Added : 305 causal constraints over 61 iterations in 3576 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 884 edges and 920 vertex of which 50 / 920 are part of one of the 8 SCC in 6 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 878 transition count 769
Reduce places removed 237 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 240 rules applied. Total rules applied 478 place count 641 transition count 766
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 481 place count 638 transition count 766
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 481 place count 638 transition count 713
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 587 place count 585 transition count 713
Discarding 309 places :
Symmetric choice reduction at 3 with 309 rule applications. Total rules 896 place count 276 transition count 404
Iterating global reduction 3 with 309 rules applied. Total rules applied 1205 place count 276 transition count 404
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1205 place count 276 transition count 399
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1215 place count 271 transition count 399
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1260 place count 226 transition count 354
Iterating global reduction 3 with 45 rules applied. Total rules applied 1305 place count 226 transition count 354
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 1349 place count 226 transition count 310
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1441 place count 180 transition count 264
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1455 place count 180 transition count 250
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1463 place count 172 transition count 242
Iterating global reduction 5 with 8 rules applied. Total rules applied 1471 place count 172 transition count 242
Free-agglomeration rule applied 119 times.
Iterating global reduction 5 with 119 rules applied. Total rules applied 1590 place count 172 transition count 123
Reduce places removed 119 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 146 edges and 53 vertex of which 43 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 168 rules applied. Total rules applied 1758 place count 43 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1772 place count 43 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1773 place count 42 transition count 60
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 41 vertex of which 12 / 41 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1775 place count 35 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1787 place count 35 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 1787 place count 35 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 1799 place count 29 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1805 place count 29 transition count 36
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 1817 place count 23 transition count 30
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1823 place count 23 transition count 24
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1836 place count 16 transition count 18
Applied a total of 1836 rules in 178 ms. Remains 16 /920 variables (removed 904) and now considering 18/1057 (removed 1039) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 16/920 places, 18/1057 transitions.
// Phase 1: matrix 18 rows 16 cols
[2024-05-31 19:01:12] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 783 ms. (1275 steps per ms)
FORMULA FlexibleBarrier-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 280 ms. (3558 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 43960 ms.
ITS solved all properties within timeout

BK_STOP 1717182073316

--------------------
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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r496-tall-171640602500045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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