About the Execution of LTSMin+red for TokenRing-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2087.836 | 76353.00 | 131967.00 | 388.90 | FFTTFTFF????T??T | 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.r540-smll-171690573800167.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 TokenRing-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690573800167
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 125K Apr 11 19:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 687K Apr 11 19:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 900K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 57K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 212K Apr 11 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 11 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 519K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-00
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-01
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-02
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-03
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-04
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-05
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-06
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-07
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-08
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-09
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-10
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-11
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-12
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-13
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-14
FORMULA_NAME TokenRing-PT-010-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717247414101
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:10:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:10:17] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2024-06-01 13:10:17] [INFO ] Transformed 121 places.
[2024-06-01 13:10:17] [INFO ] Transformed 1111 transitions.
[2024-06-01 13:10:17] [INFO ] Found NUPN structural information;
[2024-06-01 13:10:17] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 298 ms.
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 4531 ms. (8 steps per ms) remains 8/14 properties
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 2717 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2299 ms. (17 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2636 ms. (15 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1920 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1983 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2206 ms. (18 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1905 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1877 ms. (21 steps per ms) remains 8/8 properties
// Phase 1: matrix 1111 rows 121 cols
[2024-06-01 13:10:24] [INFO ] Computed 11 invariants in 33 ms
[2024-06-01 13:10:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem TokenRing-PT-010-ReachabilityFireability-2024-01 is UNSAT
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1111/1232 variables, 121/253 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1232 variables, 1010/1263 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 1263 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2043 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem TokenRing-PT-010-ReachabilityFireability-2024-15 is UNSAT
FORMULA TokenRing-PT-010-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 39/121 variables, 11/93 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 39/132 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 32 ms to minimize.
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/134 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 62 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:10:30] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:10:30] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:10:30] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:10:30] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:10:31] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:10:31] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 7/141 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 13:10:31] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 4 ms to minimize.
[2024-06-01 13:10:32] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:10:32] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:10:32] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
[2024-06-01 13:10:32] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-06-01 13:10:32] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 6/147 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 13:10:33] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:10:33] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:10:33] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
SMT process timed out in 9466ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 94 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 40000 steps (8 resets) in 791 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 395 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 580 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 554 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 736 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 345 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 592 ms. (67 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 242871 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 6
Probabilistic random walk after 242871 steps, saw 42334 distinct states, run finished after 3011 ms. (steps per millisecond=80 ) properties seen :0
[2024-06-01 13:10:38] [INFO ] Invariant cache hit.
[2024-06-01 13:10:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 43/121 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 43/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1111/1232 variables, 121/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 1010/1263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 1263 constraints, problems are : Problem set: 0 solved, 6 unsolved in 946 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, ReadFeed: 1010/1010 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/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 43/121 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 43/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:10:39] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 62 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:10:40] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:10:41] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 2 ms to minimize.
[2024-06-01 13:10:42] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:10:42] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 2 ms to minimize.
[2024-06-01 13:10:42] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:10:42] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 2 ms to minimize.
[2024-06-01 13:10:43] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 10/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:10:43] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:10:43] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:10:44] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 2 ms to minimize.
[2024-06-01 13:10:44] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:10:44] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:10:45] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:10:45] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:10:45] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:10:45] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:10:46] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:10:46] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1111/1232 variables, 121/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1232 variables, 1010/1288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1232 variables, 6/1294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1232 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1232 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 1294 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10391 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 25/25 constraints]
After SMT, in 11536ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 5595 ms.
Support contains 78 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 37 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 121/121 places, 1111/1111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 26 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-06-01 13:10:55] [INFO ] Invariant cache hit.
[2024-06-01 13:10:55] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 13:10:55] [INFO ] Invariant cache hit.
[2024-06-01 13:10:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:10:56] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2024-06-01 13:10:57] [INFO ] Redundant transitions in 124 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-06-01 13:10:57] [INFO ] Invariant cache hit.
[2024-06-01 13:10:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 2 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 66 places in 349 ms of which 2 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 3 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 2 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 2 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 2 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 2 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 2 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-06-01 13:11:12] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:11:12] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:11:12] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
[2024-06-01 13:11:12] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:11:13] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-06-01 13:11:13] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:11:13] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-06-01 13:11:13] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:11:14] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 2 ms to minimize.
[2024-06-01 13:11:14] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-06-01 13:11:14] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:11:15] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:11:15] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 3 ms to minimize.
[2024-06-01 13:11:15] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:11:15] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-06-01 13:11:16] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
[2024-06-01 13:11:16] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 13:11:23] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 68 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 2 ms to minimize.
[2024-06-01 13:11:24] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:11:25] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 2 ms to minimize.
[2024-06-01 13:11:25] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 2 ms to minimize.
[2024-06-01 13:11:25] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:11:26] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:11:26] [INFO ] Deduced a trap composed of 68 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:11:26] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:11:26] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:11:27] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-06-01 13:11:27] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 2 ms to minimize.
[2024-06-01 13:11:27] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:11:27] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 2 ms to minimize.
[2024-06-01 13:11:28] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:11:28] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
SMT process timed out in 31215ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32673 ms. Remains : 121/121 places, 1111/1111 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 121 vertex of which 35 / 121 are part of one of the 8 SCC in 6 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 134 transitions
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 460 transitions.
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 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 650
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 93 transition count 649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 92 transition count 649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 92 transition count 648
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 91 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 511 transitions
Redundant transition composition rules discarded 511 transitions
Iterating global reduction 3 with 511 rules applied. Total rules applied 518 place count 91 transition count 137
Applied a total of 518 rules in 101 ms. Remains 91 /121 variables (removed 30) and now considering 137/1111 (removed 974) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 137 rows 91 cols
[2024-06-01 13:11:28] [INFO ] Computed 11 invariants in 7 ms
[2024-06-01 13:11:28] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 13:11:28] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 13:11:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 13:11:28] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 13:11:29] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 13:11:29] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 987 ms.
[2024-06-01 13:11:29] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-06-01 13:11:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 1111 transitions and 4444 arcs took 18 ms.
[2024-06-01 13:11:29] [INFO ] Flatten gal took : 222 ms
Total runtime 73326 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 : TokenRing-PT-010-ReachabilityFireability-2024-08
Could not compute solution for formula : TokenRing-PT-010-ReachabilityFireability-2024-09
Could not compute solution for formula : TokenRing-PT-010-ReachabilityFireability-2024-10
Could not compute solution for formula : TokenRing-PT-010-ReachabilityFireability-2024-11
Could not compute solution for formula : TokenRing-PT-010-ReachabilityFireability-2024-13
Could not compute solution for formula : TokenRing-PT-010-ReachabilityFireability-2024-14
BK_STOP 1717247490454
--------------------
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
mcc2024
rfs formula name TokenRing-PT-010-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/854/inv_0_
rfs formula name TokenRing-PT-010-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/854/inv_1_
rfs formula name TokenRing-PT-010-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/854/inv_2_
rfs formula name TokenRing-PT-010-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/854/inv_3_
rfs formula name TokenRing-PT-010-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/854/inv_4_
rfs formula name TokenRing-PT-010-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/854/inv_5_
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="TokenRing-PT-010"
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 TokenRing-PT-010, 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 r540-smll-171690573800167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-010.tgz
mv TokenRing-PT-010 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 ;