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-171701110800117.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 UtilityControlRoom-COL-Z4T4N04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701110800117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 13 05:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 05:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 05:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 05:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 05:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 13 05:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 05:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 13 05:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K 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 UtilityControlRoom-COL-Z4T4N04-UpperBounds-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717265757915

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:15:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 18:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:16:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 18:16:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 18:16:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1103 ms
[2024-06-01 18:16:01] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 154 PT places and 300.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-06-01 18:16:01] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-06-01 18:16:01] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-06-01 18:16:01] [INFO ] Computed 5 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 4, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 4, 4, 4]
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 18:16:01] [INFO ] Invariant cache hit.
[2024-06-01 18:16:01] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-06-01 18:16:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 18:16:01] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 18:16:01] [INFO ] Added : 4 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 18:16:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-06-01 18:16:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 18:16:01] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 18:16:01] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 18:16:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 18:16:01] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 18:16:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 18:16:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 18:16:02] [INFO ] Added : 10 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 18:16:02] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 18:16:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 18:16:02] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 18:16:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 18:16:02] [INFO ] Added : 7 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 18:16:02] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 18:16:02] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 18:16:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 18:16:02] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 18:16:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 18:16:02] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 18:16:02] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 18:16:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 18:16:02] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 18:16:02] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 18:16:02] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 4, 4]
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(4), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-06-01 18:16:02] [INFO ] Unfolded HLPN to a Petri net with 154 places and 300 transitions 964 arcs in 39 ms.
[2024-06-01 18:16:02] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 4, 4]
// Phase 1: matrix 236 rows 154 cols
[2024-06-01 18:16:02] [INFO ] Computed 11 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 4, 4]
RANDOM walk for 10000 steps (2 resets) in 92 ms. (107 steps per ms)
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000 steps (2 resets) in 22 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 18:16:03] [INFO ] Invariant cache hit.
[2024-06-01 18:16:03] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 18:16:03] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-06-01 18:16:03] [INFO ] Computed and/alt/rep : 232/420/232 causal constraints (skipped 0 transitions) in 38 ms.
[2024-06-01 18:16:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:16:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 18:16:03] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-01 18:16:03] [INFO ] Computed and/alt/rep : 232/420/232 causal constraints (skipped 0 transitions) in 37 ms.
[2024-06-01 18:16:04] [INFO ] Added : 118 causal constraints over 24 iterations in 551 ms. Result :sat
Minimization took 147 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[4]
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 90 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 74 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 71 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 71 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 59 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 59 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 47 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 47 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 242 place count 35 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 35 transition count 44
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 35 transition count 32
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 275 place count 30 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 279 place count 30 transition count 24
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 287 place count 26 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 287 place count 26 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 295 place count 22 transition count 16
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 299 place count 22 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 304 place count 17 transition count 12
Applied a total of 304 rules in 81 ms. Remains 17 /154 variables (removed 137) and now considering 12/236 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 17/154 places, 12/236 transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-06-01 18:16:04] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[4]
FORMULA UtilityControlRoom-COL-Z4T4N04-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1034 ms. (966 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 5693 ms.
ITS solved all properties within timeout

BK_STOP 1717265765710

--------------------
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="UtilityControlRoom-COL-Z4T4N04"
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 UtilityControlRoom-COL-Z4T4N04, 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-171701110800117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N04.tgz
mv UtilityControlRoom-COL-Z4T4N04 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 ;