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.r484-smll-171624275400175.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 DLCround-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275400175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 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 813K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-00
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717224642167

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:50:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:50:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:50:46] [INFO ] Load time of PNML (sax parser for PT used): 617 ms
[2024-06-01 06:50:46] [INFO ] Transformed 2340 places.
[2024-06-01 06:50:46] [INFO ] Transformed 3456 transitions.
[2024-06-01 06:50:46] [INFO ] Found NUPN structural information;
[2024-06-01 06:50:46] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 994 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2920 ms. (13 steps per ms) remains 6/16 properties
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 458 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
// Phase 1: matrix 3456 rows 2340 cols
[2024-06-01 06:50:48] [INFO ] Computed 109 invariants in 66 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2180/2280 variables, 103/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2280 variables, 2180/2383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2280 variables, 0/2383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 60/2340 variables, 6/2389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2340 variables, 60/2449 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2340 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3456/5796 variables, 2340/4789 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5796 variables, 0/4789 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5796/5796 variables, and 4789 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5129 ms.
Refiners :[Domain max(s): 2340/2340 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 2340/2340 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2180/2280 variables, 103/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2280 variables, 2180/2383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:50:55] [INFO ] Deduced a trap composed of 158 places in 325 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2280 variables, 1/2384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 181 places in 334 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2280 variables, 1/2385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 153 places in 369 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2280 variables, 1/2386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2280 variables, 0/2386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 60/2340 variables, 6/2392 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2340 variables, 60/2452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2340/5796 variables, and 2452 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5010 ms.
Refiners :[Domain max(s): 2340/2340 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 0/2340 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 10635ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 2340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Graph (trivial) has 2039 edges and 2340 vertex of which 353 / 2340 are part of one of the 30 SCC in 25 ms
Free SCC test removed 323 places
Drop transitions (Empty/Sink Transition effects.) removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 841 transitions
Trivial Post-agglo rules discarded 841 transitions
Performed 841 trivial Post agglomeration. Transition count delta: 841
Iterating post reduction 0 with 841 rules applied. Total rules applied 842 place count 2017 transition count 2251
Reduce places removed 841 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 890 rules applied. Total rules applied 1732 place count 1176 transition count 2202
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 31 rules applied. Total rules applied 1763 place count 1153 transition count 2194
Reduce places removed 4 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 3 with 36 rules applied. Total rules applied 1799 place count 1149 transition count 2162
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 1833 place count 1117 transition count 2160
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 34 Pre rules applied. Total rules applied 1833 place count 1117 transition count 2126
Deduced a syphon composed of 34 places in 8 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 1901 place count 1083 transition count 2126
Discarding 268 places :
Symmetric choice reduction at 5 with 268 rule applications. Total rules 2169 place count 815 transition count 1858
Iterating global reduction 5 with 268 rules applied. Total rules applied 2437 place count 815 transition count 1858
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2441 place count 815 transition count 1854
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 97 Pre rules applied. Total rules applied 2441 place count 815 transition count 1757
Deduced a syphon composed of 97 places in 22 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 6 with 194 rules applied. Total rules applied 2635 place count 718 transition count 1757
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 2661 place count 692 transition count 1524
Iterating global reduction 6 with 26 rules applied. Total rules applied 2687 place count 692 transition count 1524
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2694 place count 692 transition count 1517
Performed 164 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 164 places in 3 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 7 with 328 rules applied. Total rules applied 3022 place count 528 transition count 1351
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 3025 place count 528 transition count 1348
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3029 place count 524 transition count 1308
Iterating global reduction 8 with 4 rules applied. Total rules applied 3033 place count 524 transition count 1308
Performed 50 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 8 with 100 rules applied. Total rules applied 3133 place count 474 transition count 1765
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 8 with 45 rules applied. Total rules applied 3178 place count 474 transition count 1720
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 3184 place count 468 transition count 1605
Iterating global reduction 9 with 6 rules applied. Total rules applied 3190 place count 468 transition count 1605
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 3207 place count 468 transition count 1588
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3211 place count 466 transition count 1613
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 3214 place count 466 transition count 1610
Drop transitions (Redundant composition of simpler transitions.) removed 67 transitions
Redundant transition composition rules discarded 67 transitions
Iterating global reduction 11 with 67 rules applied. Total rules applied 3281 place count 466 transition count 1543
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3284 place count 463 transition count 1506
Iterating global reduction 11 with 3 rules applied. Total rules applied 3287 place count 463 transition count 1506
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3290 place count 463 transition count 1503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3292 place count 462 transition count 1515
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 3294 place count 462 transition count 1513
Free-agglomeration rule applied 156 times with reduction of 70 identical transitions.
Iterating global reduction 13 with 156 rules applied. Total rules applied 3450 place count 462 transition count 1287
Reduce places removed 156 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 190 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 13 with 361 rules applied. Total rules applied 3811 place count 306 transition count 1082
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 3814 place count 303 transition count 1074
Iterating global reduction 14 with 3 rules applied. Total rules applied 3817 place count 303 transition count 1074
Drop transitions (Redundant composition of simpler transitions.) removed 106 transitions
Redundant transition composition rules discarded 106 transitions
Iterating global reduction 14 with 106 rules applied. Total rules applied 3923 place count 303 transition count 968
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 3925 place count 301 transition count 962
Iterating global reduction 14 with 2 rules applied. Total rules applied 3927 place count 301 transition count 962
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 3938 place count 301 transition count 962
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 3939 place count 301 transition count 962
Applied a total of 3939 rules in 1493 ms. Remains 301 /2340 variables (removed 2039) and now considering 962/3456 (removed 2494) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1531 ms. Remains : 301/2340 places, 962/3456 transitions.
RANDOM walk for 21360 steps (4 resets) in 495 ms. (43 steps per ms) remains 0/6 properties
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15525 ms.
ITS solved all properties within timeout

BK_STOP 1717224660732

--------------------
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 ReachabilityFireability -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="DLCround-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
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 DLCround-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r484-smll-171624275400175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06b.tgz
mv DLCround-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;