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.r579-smll-171734921200071.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 MedleyA-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 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 MedleyA-PT-09-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-09-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717355343333

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:09:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:09:05] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-06-02 19:09:05] [INFO ] Transformed 147 places.
[2024-06-02 19:09:05] [INFO ] Transformed 315 transitions.
[2024-06-02 19:09:05] [INFO ] Found NUPN structural information;
[2024-06-02 19:09:05] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
RANDOM walk for 40000 steps (1309 resets) in 2543 ms. (15 steps per ms) remains 11/16 properties
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (282 resets) in 398 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (283 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (286 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (294 resets) in 592 ms. (67 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (287 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (265 resets) in 1019 ms. (39 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (273 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (294 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (284 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (297 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (270 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
// Phase 1: matrix 313 rows 145 cols
[2024-06-02 19:09:07] [INFO ] Computed 12 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MedleyA-PT-09-ReachabilityFireability-2024-00 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-09-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 41/127 variables, 7/94 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 41/135 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 18/145 variables, 4/139 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 18/157 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 313/458 variables, 145/302 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/302 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/458 variables, 0/302 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 302 constraints, problems are : Problem set: 2 solved, 9 unsolved in 1111 ms.
Refiners :[Domain max(s): 145/145 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 1/72 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem MedleyA-PT-09-ReachabilityFireability-2024-07 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-09-ReachabilityFireability-2024-14 is UNSAT
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 48/119 variables, 7/79 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 48/127 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 26/145 variables, 4/131 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 26/157 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-02 19:09:09] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 31 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/158 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/158 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 313/458 variables, 145/303 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 7/310 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/310 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/310 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 310 constraints, problems are : Problem set: 4 solved, 7 unsolved in 2090 ms.
Refiners :[Domain max(s): 145/145 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 3582ms problems are : Problem set: 4 solved, 7 unsolved
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 4359 ms.
Support contains 44 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 313/313 transitions.
Graph (complete) has 480 edges and 145 vertex of which 140 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 140 transition count 307
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 138 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 136 transition count 305
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 10 place count 136 transition count 296
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 28 place count 127 transition count 296
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 55 place count 100 transition count 267
Iterating global reduction 3 with 27 rules applied. Total rules applied 82 place count 100 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 99 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 99 transition count 265
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 92 place count 95 transition count 261
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 91 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 122 place count 91 transition count 256
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 91 transition count 255
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 90 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 126 place count 89 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 126 place count 89 transition count 253
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 128 place count 88 transition count 253
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 131 place count 88 transition count 250
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 134 place count 85 transition count 250
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 140 place count 85 transition count 250
Applied a total of 140 rules in 154 ms. Remains 85 /145 variables (removed 60) and now considering 250/313 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 85/145 places, 250/313 transitions.
RANDOM walk for 40000 steps (2054 resets) in 242 ms. (164 steps per ms) remains 2/3 properties
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (385 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (367 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
// Phase 1: matrix 250 rows 85 cols
[2024-06-02 19:09:16] [INFO ] Computed 11 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/84 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/334 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/335 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/335 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 96 constraints, problems are : Problem set: 0 solved, 2 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/84 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/334 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/335 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/335 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 98 constraints, problems are : Problem set: 0 solved, 2 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 914ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 276 ms.
Support contains 44 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 85/85 places, 250/250 transitions.
RANDOM walk for 40000 steps (2038 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (397 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (375 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 889890 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 2
Probabilistic random walk after 889890 steps, saw 173512 distinct states, run finished after 3010 ms. (steps per millisecond=295 ) properties seen :0
[2024-06-02 19:09:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/84 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 250/334 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/335 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/335 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 96 constraints, problems are : Problem set: 0 solved, 2 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:09:20] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 18/84 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 250/334 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/335 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/335 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 921ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 83 ms.
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 250/250 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 85 transition count 240
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 75 transition count 240
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 69 transition count 233
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 69 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 69 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 68 transition count 232
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 66 place count 52 transition count 216
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 48 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 48 transition count 229
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 48 transition count 226
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 45 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 45 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 44 transition count 226
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 44 transition count 226
Applied a total of 95 rules in 69 ms. Remains 44 /85 variables (removed 41) and now considering 226/250 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 44/85 places, 226/250 transitions.
RANDOM walk for 40000 steps (4007 resets) in 647 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (742 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 162412 steps, run visited all 1 properties in 345 ms. (steps per millisecond=470 )
Probabilistic random walk after 162412 steps, saw 35825 distinct states, run finished after 350 ms. (steps per millisecond=464 ) properties seen :1
FORMULA MedleyA-PT-09-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 17059 ms.
ITS solved all properties within timeout

BK_STOP 1717355362166

--------------------
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="MedleyA-PT-09"
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 MedleyA-PT-09, 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 r579-smll-171734921200071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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