About the Execution of LTSMin+red for CANInsertWithFailure-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1074.735 | 190559.00 | 231832.00 | 298.80 | ??F??F?T?FF?TF?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.r476-tall-171620505200110.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 CANInsertWithFailure-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200110
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 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 2.6M 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 CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-00
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-01
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-04
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-11
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717187214261
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:26:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:26:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:26:55] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-05-31 20:26:55] [INFO ] Transformed 1044 places.
[2024-05-31 20:26:55] [INFO ] Transformed 2520 transitions.
[2024-05-31 20:26:55] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (82 resets) in 2018 ms. (19 steps per ms) remains 11/16 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 814 ms. (49 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
// Phase 1: matrix 2520 rows 1044 cols
[2024-05-31 20:26:57] [INFO ] Computed 23 invariants in 74 ms
[2024-05-31 20:26:57] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-12 is UNSAT
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 704/1038 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1038 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/1040 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/1042 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2520/3562 variables, 1042/1064 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3562 variables, 780/1844 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3562 variables, 0/1844 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/3564 variables, 2/1846 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3564 variables, 1/1847 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3564/3564 variables, and 1847 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5041 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1044/1044 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 725/1038 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 20:27:02] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 21 ms to minimize.
[2024-05-31 20:27:03] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1038 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1038 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/1040 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/1042 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 20:27:04] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 4 ms to minimize.
[2024-05-31 20:27:05] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 5 ms to minimize.
[2024-05-31 20:27:05] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 4 ms to minimize.
[2024-05-31 20:27:05] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 3 ms to minimize.
[2024-05-31 20:27:06] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 4 ms to minimize.
[2024-05-31 20:27:06] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 4 ms to minimize.
[2024-05-31 20:27:06] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 6 ms to minimize.
[2024-05-31 20:27:07] [INFO ] Deduced a trap composed of 46 places in 277 ms of which 5 ms to minimize.
[2024-05-31 20:27:07] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 5 ms to minimize.
SMT process timed out in 10423ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 313 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 1043 transition count 2484
Reduce places removed 36 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 67 rules applied. Total rules applied 104 place count 1007 transition count 2453
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 135 place count 976 transition count 2453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 135 place count 976 transition count 2446
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 149 place count 969 transition count 2446
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 301 place count 893 transition count 2370
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 3 with 71 rules applied. Total rules applied 372 place count 893 transition count 2299
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 378 place count 893 transition count 2293
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 887 transition count 2293
Partial Free-agglomeration rule applied 512 times.
Drop transitions (Partial Free agglomeration) removed 512 transitions
Iterating global reduction 4 with 512 rules applied. Total rules applied 896 place count 887 transition count 2293
Partial Free-agglomeration rule applied 129 times.
Drop transitions (Partial Free agglomeration) removed 129 transitions
Iterating global reduction 4 with 129 rules applied. Total rules applied 1025 place count 887 transition count 2293
Applied a total of 1025 rules in 426 ms. Remains 887 /1044 variables (removed 157) and now considering 2293/2520 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 887/1044 places, 2293/2520 transitions.
RANDOM walk for 40000 steps (133 resets) in 505 ms. (79 steps per ms) remains 9/10 properties
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
// Phase 1: matrix 2293 rows 887 cols
[2024-05-31 20:27:08] [INFO ] Computed 22 invariants in 46 ms
[2024-05-31 20:27:08] [INFO ] State equation strengthened by 896 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 573/881 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/885 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/886 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2293/3179 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3179 variables, 896/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3179 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/3180 variables, 1/1805 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3180 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/3180 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3180/3180 variables, and 1805 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5175 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 887/887 constraints, ReadFeed: 896/896 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 573/881 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:27:14] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/885 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/885 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/886 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:27:15] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 4 ms to minimize.
[2024-05-31 20:27:15] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 4 ms to minimize.
[2024-05-31 20:27:15] [INFO ] Deduced a trap composed of 43 places in 279 ms of which 4 ms to minimize.
[2024-05-31 20:27:16] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 4 ms to minimize.
[2024-05-31 20:27:16] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 4 ms to minimize.
[2024-05-31 20:27:16] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 4 ms to minimize.
[2024-05-31 20:27:17] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 4 ms to minimize.
[2024-05-31 20:27:17] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 4 ms to minimize.
[2024-05-31 20:27:17] [INFO ] Deduced a trap composed of 37 places in 312 ms of which 5 ms to minimize.
[2024-05-31 20:27:18] [INFO ] Deduced a trap composed of 41 places in 308 ms of which 5 ms to minimize.
[2024-05-31 20:27:18] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 4 ms to minimize.
[2024-05-31 20:27:18] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 4 ms to minimize.
[2024-05-31 20:27:18] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 4 ms to minimize.
[2024-05-31 20:27:19] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 4 ms to minimize.
[2024-05-31 20:27:19] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 4 ms to minimize.
[2024-05-31 20:27:19] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 4 ms to minimize.
[2024-05-31 20:27:20] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 4 ms to minimize.
[2024-05-31 20:27:20] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 4 ms to minimize.
[2024-05-31 20:27:20] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 4 ms to minimize.
[2024-05-31 20:27:21] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/886 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:27:21] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 4 ms to minimize.
[2024-05-31 20:27:21] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 4 ms to minimize.
[2024-05-31 20:27:22] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 7 ms to minimize.
[2024-05-31 20:27:22] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 4 ms to minimize.
[2024-05-31 20:27:23] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 3 ms to minimize.
[2024-05-31 20:27:23] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 4 ms to minimize.
[2024-05-31 20:27:23] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:27:23] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 4 ms to minimize.
[2024-05-31 20:27:24] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 4 ms to minimize.
[2024-05-31 20:27:24] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:27:25] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/886 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 20:27:26] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 4 ms to minimize.
[2024-05-31 20:27:27] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/886 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2293/3179 variables, 886/942 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (INCLUDED_ONLY) 0/3179 variables, 896/1838 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3179 variables, 8/1846 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3179 variables, 0/1846 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SMT process timed out in 50376ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 3393 ms.
Support contains 279 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 2293/2293 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 887 transition count 2290
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 884 transition count 2286
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 880 transition count 2286
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 38 place count 868 transition count 2274
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 868 transition count 2271
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 71 place count 868 transition count 2271
Applied a total of 71 rules in 140 ms. Remains 868 /887 variables (removed 19) and now considering 2271/2293 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 868/887 places, 2271/2293 transitions.
RANDOM walk for 40000 steps (138 resets) in 345 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 207666 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 8
Probabilistic random walk after 207666 steps, saw 46842 distinct states, run finished after 3004 ms. (steps per millisecond=69 ) properties seen :0
// Phase 1: matrix 2271 rows 868 cols
[2024-05-31 20:28:05] [INFO ] Computed 22 invariants in 29 ms
[2024-05-31 20:28:05] [INFO ] State equation strengthened by 972 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 583/862 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/866 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/867 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/867 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2271/3138 variables, 867/889 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3138 variables, 972/1861 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3138 variables, 0/1861 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/3139 variables, 1/1862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3139 variables, 0/1862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/3139 variables, 0/1862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3139/3139 variables, and 1862 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4463 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 868/868 constraints, ReadFeed: 972/972 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 583/862 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:28:10] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:28:10] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/862 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/866 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/866 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/867 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:28:11] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 3 ms to minimize.
[2024-05-31 20:28:11] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 3 ms to minimize.
[2024-05-31 20:28:12] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2024-05-31 20:28:12] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 4 ms to minimize.
[2024-05-31 20:28:12] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 3 ms to minimize.
[2024-05-31 20:28:12] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 3 ms to minimize.
[2024-05-31 20:28:13] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 4 ms to minimize.
[2024-05-31 20:28:13] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 4 ms to minimize.
[2024-05-31 20:28:13] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 4 ms to minimize.
[2024-05-31 20:28:13] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 7 ms to minimize.
[2024-05-31 20:28:14] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 4 ms to minimize.
[2024-05-31 20:28:14] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 4 ms to minimize.
[2024-05-31 20:28:14] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 4 ms to minimize.
[2024-05-31 20:28:14] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 4 ms to minimize.
[2024-05-31 20:28:15] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 4 ms to minimize.
[2024-05-31 20:28:15] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 4 ms to minimize.
[2024-05-31 20:28:15] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 4 ms to minimize.
[2024-05-31 20:28:16] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 3 ms to minimize.
[2024-05-31 20:28:16] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/867 variables, 19/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/867 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2271/3138 variables, 867/910 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3138 variables, 972/1882 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3138 variables, 8/1890 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3138 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 1/3139 variables, 1/1891 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3139 variables, 0/1891 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3139/3139 variables, and 1891 constraints, problems are : Problem set: 0 solved, 8 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 868/868 constraints, ReadFeed: 972/972 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 21/21 constraints]
After SMT, in 79623ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 279 out of 868 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 2271/2271 transitions.
Applied a total of 0 rules in 40 ms. Remains 868 /868 variables (removed 0) and now considering 2271/2271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 868/868 places, 2271/2271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 2271/2271 transitions.
Applied a total of 0 rules in 32 ms. Remains 868 /868 variables (removed 0) and now considering 2271/2271 (removed 0) transitions.
[2024-05-31 20:29:25] [INFO ] Invariant cache hit.
[2024-05-31 20:29:25] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-31 20:29:25] [INFO ] Invariant cache hit.
[2024-05-31 20:29:26] [INFO ] State equation strengthened by 972 read => feed constraints.
[2024-05-31 20:29:28] [INFO ] Implicit Places using invariants and state equation in 2675 ms returned []
Implicit Place search using SMT with State Equation took 3050 ms to find 0 implicit places.
[2024-05-31 20:29:28] [INFO ] Redundant transitions in 112 ms returned []
Running 2251 sub problems to find dead transitions.
[2024-05-31 20:29:28] [INFO ] Invariant cache hit.
[2024-05-31 20:29:28] [INFO ] State equation strengthened by 972 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2251 unsolved
[2024-05-31 20:29:56] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 4 ms to minimize.
[2024-05-31 20:29:57] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 4 ms to minimize.
[2024-05-31 20:29:58] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-05-31 20:29:58] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
[2024-05-31 20:29:58] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 3 ms to minimize.
[2024-05-31 20:29:58] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 3 ms to minimize.
[2024-05-31 20:29:59] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-31 20:29:59] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:29:59] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-05-31 20:29:59] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:29:59] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-05-31 20:29:59] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 31249ms, After SMT, problems are : Problem set: 0 solved, 2251 unsolved
Search for dead transitions found 0 dead transitions in 31270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34487 ms. Remains : 868/868 places, 2271/2271 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 524 edges and 868 vertex of which 42 / 868 are part of one of the 2 SCC in 5 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (complete) has 2450 edges and 828 vertex of which 805 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 805 transition count 2086
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 799 transition count 2074
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 799 transition count 2074
Drop transitions (Redundant composition of simpler transitions.) removed 154 transitions
Redundant transition composition rules discarded 154 transitions
Iterating global reduction 1 with 154 rules applied. Total rules applied 252 place count 799 transition count 1920
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 295 place count 799 transition count 1877
Reduce places removed 43 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 2 with 74 rules applied. Total rules applied 369 place count 756 transition count 1846
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 400 place count 725 transition count 1846
Free-agglomeration rule applied 223 times with reduction of 28 identical transitions.
Iterating global reduction 4 with 223 rules applied. Total rules applied 623 place count 725 transition count 1595
Reduce places removed 223 places and 0 transitions.
Ensure Unique test removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Iterating post reduction 4 with 445 rules applied. Total rules applied 1068 place count 502 transition count 1373
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 5 with 39 rules applied. Total rules applied 1107 place count 502 transition count 1334
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1108 place count 502 transition count 1334
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1110 place count 501 transition count 1333
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1112 place count 501 transition count 1331
Partial Free-agglomeration rule applied 48 times.
Drop transitions (Partial Free agglomeration) removed 48 transitions
Iterating global reduction 6 with 48 rules applied. Total rules applied 1160 place count 501 transition count 1331
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1164 place count 501 transition count 1327
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1168 place count 501 transition count 1327
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1171 place count 501 transition count 1324
Applied a total of 1171 rules in 351 ms. Remains 501 /868 variables (removed 367) and now considering 1324/2271 (removed 947) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1324 rows 501 cols
[2024-05-31 20:30:00] [INFO ] Computed 7 invariants in 5 ms
[2024-05-31 20:30:00] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-31 20:30:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 20:30:01] [INFO ] After 1081ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-31 20:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 20:30:02] [INFO ] After 899ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-31 20:30:03] [INFO ] After 1840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-31 20:30:04] [INFO ] After 3835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 4381 ms.
[2024-05-31 20:30:04] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 20:30:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 868 places, 2271 transitions and 7207 arcs took 12 ms.
[2024-05-31 20:30:04] [INFO ] Flatten gal took : 151 ms
Total runtime 189171 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 : CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-00
Could not compute solution for formula : CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-01
Could not compute solution for formula : CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-04
Could not compute solution for formula : CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-11
Could not compute solution for formula : CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-14
BK_STOP 1717187404820
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-00
rfs formula type EF
rfs formula formula --invariant=/tmp/793/inv_0_
rfs formula name CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-01
rfs formula type AG
rfs formula formula --invariant=/tmp/793/inv_1_
rfs formula name CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/793/inv_2_
rfs formula name CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-04
rfs formula type AG
rfs formula formula --invariant=/tmp/793/inv_3_
rfs formula name CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/793/inv_4_
rfs formula name CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/793/inv_5_
rfs formula name CANInsertWithFailure-PT-020-ReachabilityCardinality-2023-11
rfs formula type AG
rfs formula formula --invariant=/tmp/793/inv_6_
rfs formula name CANInsertWithFailure-PT-020-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/793/inv_7_
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="CANInsertWithFailure-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANInsertWithFailure-PT-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505200110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;