About the Execution of LTSMin+red for DES-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 533.363 | 133658.00 | 201139.00 | 425.40 | FTFTF?F?FTT?TT?F | normal |
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.r480-tall-171624189900719.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 DES-PT-40a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900719
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 83K 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 DES-PT-40a-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-40a-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717196069964
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:54:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:54:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:54:31] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-31 22:54:31] [INFO ] Transformed 274 places.
[2024-05-31 22:54:31] [INFO ] Transformed 231 transitions.
[2024-05-31 22:54:31] [INFO ] Found NUPN structural information;
[2024-05-31 22:54:31] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
RANDOM walk for 40000 steps (890 resets) in 1697 ms. (23 steps per ms) remains 13/16 properties
FORMULA DES-PT-40a-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (193 resets) in 357 ms. (111 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (190 resets) in 259 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (184 resets) in 268 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (253 resets) in 1000 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (174 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (234 resets) in 237 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (177 resets) in 310 ms. (128 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (248 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (182 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (253 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (188 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (164 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (186 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
// Phase 1: matrix 217 rows 274 cols
[2024-05-31 22:54:33] [INFO ] Computed 59 invariants in 27 ms
[2024-05-31 22:54:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 34/152 variables, 29/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 34/182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 10/162 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 10/197 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 81/243 variables, 23/221 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 81/302 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 216/459 variables, 243/545 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 5264ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 118 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 273 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 273 transition count 215
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 215
Applied a total of 4 rules in 76 ms. Remains 273 /274 variables (removed 1) and now considering 215/217 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 273/274 places, 215/217 transitions.
RANDOM walk for 40000 steps (747 resets) in 1219 ms. (32 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (138 resets) in 179 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (141 resets) in 135 ms. (294 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (133 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (244 resets) in 187 ms. (212 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (131 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (203 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (120 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (248 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (140 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (244 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (142 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (114 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (137 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 610768 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 13
Probabilistic random walk after 610768 steps, saw 92127 distinct states, run finished after 3009 ms. (steps per millisecond=202 ) properties seen :0
// Phase 1: matrix 215 rows 273 cols
[2024-05-31 22:54:42] [INFO ] Computed 60 invariants in 9 ms
[2024-05-31 22:54:42] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 35/153 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 10/163 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 81/244 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 215/459 variables, 244/304 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 29/488 variables, 29/334 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 334 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3083 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 35/153 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 10/163 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 81/244 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 215/459 variables, 244/304 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:54:48] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 21 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 29/488 variables, 29/339 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 9/348 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/488 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:54:55] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/488 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:54:59] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:55:00] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:55:03] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 0/488 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 353 constraints, problems are : Problem set: 0 solved, 13 unsolved in 24439 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 6/6 constraints]
After SMT, in 27640ms problems are : Problem set: 0 solved, 13 unsolved
FORMULA DES-PT-40a-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 9 properties in 27018 ms.
Support contains 86 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 273 transition count 215
Applied a total of 1 rules in 24 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 273/273 places, 215/215 transitions.
RANDOM walk for 40000 steps (755 resets) in 247 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (207 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (128 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (149 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (107 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 790354 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 4
Probabilistic random walk after 790354 steps, saw 113956 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
// Phase 1: matrix 215 rows 273 cols
[2024-05-31 22:55:40] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 22:55:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 36/122 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/134 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 102/236 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/239 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 215/454 variables, 239/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 34/488 variables, 34/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 334 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 36/122 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/134 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 102/236 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/239 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 215/454 variables, 239/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 34/488 variables, 34/335 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/488 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:55:44] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/488 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:55:44] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:55:44] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/488 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 341 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5565 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 6680ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 10931 ms.
Support contains 86 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 12 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 273/273 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 11 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-31 22:55:58] [INFO ] Invariant cache hit.
[2024-05-31 22:55:58] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-31 22:55:58] [INFO ] Invariant cache hit.
[2024-05-31 22:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:55:58] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-31 22:55:58] [INFO ] Redundant transitions in 8 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-31 22:55:58] [INFO ] Invariant cache hit.
[2024-05-31 22:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/488 variables, 273/333 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:56:02] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:56:04] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/488 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 336 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12386 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:56:13] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:56:14] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 215/488 variables, 273/337 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 214/552 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-31 22:56:22] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:56:24] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:56:27] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 555 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 7/7 constraints]
After SMT, in 42541ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 42544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42977 ms. Remains : 273/273 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-31 22:56:41] [INFO ] Invariant cache hit.
[2024-05-31 22:56:41] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 22:56:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-31 22:56:41] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-31 22:56:42] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 22:56:42] [INFO ] After 1110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 22:56:43] [INFO ] After 1745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1914 ms.
[2024-05-31 22:56:43] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-31 22:56:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 215 transitions and 1051 arcs took 5 ms.
[2024-05-31 22:56:43] [INFO ] Flatten gal took : 62 ms
Total runtime 132077 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DES-PT-40a-ReachabilityFireability-2024-05
Could not compute solution for formula : DES-PT-40a-ReachabilityFireability-2024-07
Could not compute solution for formula : DES-PT-40a-ReachabilityFireability-2024-11
Could not compute solution for formula : DES-PT-40a-ReachabilityFireability-2024-14
BK_STOP 1717196203622
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name DES-PT-40a-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_0_
rfs formula name DES-PT-40a-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/604/inv_1_
rfs formula name DES-PT-40a-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_2_
rfs formula name DES-PT-40a-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="DES-PT-40a"
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 DES-PT-40a, 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 r480-tall-171624189900719"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 '
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 ;