About the Execution of LTSMin+red for CANInsertWithFailure-PT-080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9404.867 | 636742.00 | 727843.00 | 1397.10 | F?FTTFTFF???F?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.r476-tall-171620505300159.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-080, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505300159
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 39M 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-080-ReachabilityFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2023-09
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2023-11
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2023-13
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-080-ReachabilityFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717196471336
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:01:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:01:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:01:13] [INFO ] Load time of PNML (sax parser for PT used): 975 ms
[2024-05-31 23:01:13] [INFO ] Transformed 13764 places.
[2024-05-31 23:01:13] [INFO ] Transformed 38880 transitions.
[2024-05-31 23:01:13] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1231 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 3470 ms. (11 steps per ms) remains 12/16 properties
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 671 ms. (59 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
// Phase 1: matrix 38880 rows 13764 cols
[2024-05-31 23:01:28] [INFO ] Computed 83 invariants in 12357 ms
[2024-05-31 23:01:28] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13420/13714 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13714 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 48/13762 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13762 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13762/52644 variables, and 82 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5158 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 1/2 constraints, State Equation: 0/13764 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13420/13714 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 23:01:39] [INFO ] Deduced a trap composed of 5 places in 1988 ms of which 133 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13714/52644 variables, and 58 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/81 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13764 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 23398ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 294 out of 13764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Graph (complete) has 52401 edges and 13764 vertex of which 13763 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.79 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 13763 transition count 38448
Reduce places removed 432 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 438 rules applied. Total rules applied 871 place count 13331 transition count 38442
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 877 place count 13325 transition count 38442
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 877 place count 13325 transition count 38409
Deduced a syphon composed of 33 places in 23 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 943 place count 13292 transition count 38409
Performed 6159 Post agglomeration using F-continuation condition.Transition count delta: 6159
Deduced a syphon composed of 6159 places in 27 ms
Reduce places removed 6159 places and 0 transitions.
Iterating global reduction 3 with 12318 rules applied. Total rules applied 13261 place count 7133 transition count 32250
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 13341 place count 7133 transition count 32170
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 13421 place count 7053 transition count 32170
Partial Free-agglomeration rule applied 6287 times.
Drop transitions (Partial Free agglomeration) removed 6287 transitions
Iterating global reduction 4 with 6287 rules applied. Total rules applied 19708 place count 7053 transition count 32170
Partial Free-agglomeration rule applied 2781 times.
Drop transitions (Partial Free agglomeration) removed 2781 transitions
Iterating global reduction 4 with 2781 rules applied. Total rules applied 22489 place count 7053 transition count 32170
Applied a total of 22489 rules in 16918 ms. Remains 7053 /13764 variables (removed 6711) and now considering 32170/38880 (removed 6710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16936 ms. Remains : 7053/13764 places, 32170/38880 transitions.
RANDOM walk for 40000 steps (73 resets) in 3080 ms. (12 steps per ms) remains 7/12 properties
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
[2024-05-31 23:01:57] [INFO ] Flow matrix only has 32101 transitions (discarded 69 similar events)
// Phase 1: matrix 32101 rows 7053 cols
[2024-05-31 23:02:00] [INFO ] Computed 82 invariants in 2798 ms
[2024-05-31 23:02:00] [INFO ] State equation strengthened by 30822 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6793/6965 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6965 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 86/7051 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7051 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7051 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/7052 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7052 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 32101/39153 variables, 7052/7134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39153 variables, 30822/37956 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 39153/39154 variables, and 37956 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45083 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 7052/7053 constraints, ReadFeed: 30822/30822 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6793/6965 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 23:02:48] [INFO ] Deduced a trap composed of 2 places in 677 ms of which 7 ms to minimize.
[2024-05-31 23:02:49] [INFO ] Deduced a trap composed of 2 places in 661 ms of which 7 ms to minimize.
[2024-05-31 23:02:50] [INFO ] Deduced a trap composed of 2 places in 687 ms of which 6 ms to minimize.
[2024-05-31 23:02:51] [INFO ] Deduced a trap composed of 2 places in 683 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6965 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6965 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 86/7051 variables, 43/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7051 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7051 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/7052 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7052 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 32101/39153 variables, 7052/7138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 39153/39154 variables, and 37960 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45051 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 7052/7053 constraints, ReadFeed: 30822/30822 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 93420ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 172 out of 7053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7053/7053 places, 32170/32170 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 1 place count 7053 transition count 32169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7052 transition count 32169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7052 transition count 32168
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7051 transition count 32168
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 11 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 140 place count 6983 transition count 32100
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 6983 transition count 32099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 6982 transition count 32099
Partial Free-agglomeration rule applied 113 times.
Drop transitions (Partial Free agglomeration) removed 113 transitions
Iterating global reduction 3 with 113 rules applied. Total rules applied 255 place count 6982 transition count 32099
Applied a total of 255 rules in 7966 ms. Remains 6982 /7053 variables (removed 71) and now considering 32099/32170 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7966 ms. Remains : 6982/7053 places, 32099/32170 transitions.
RANDOM walk for 40000 steps (76 resets) in 1933 ms. (20 steps per ms) remains 6/7 properties
FORMULA CANInsertWithFailure-PT-080-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
[2024-05-31 23:03:40] [INFO ] Flow matrix only has 32064 transitions (discarded 35 similar events)
// Phase 1: matrix 32064 rows 6982 cols
[2024-05-31 23:03:42] [INFO ] Computed 82 invariants in 2206 ms
[2024-05-31 23:03:42] [INFO ] State equation strengthened by 31309 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6723/6894 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6894 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 86/6980 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6980 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6980 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/6981 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6981 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 32064/39045 variables, 6981/7063 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39045 variables, 31309/38372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39045 variables, 0/38372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/39046 variables, 1/38373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/39046 variables, 0/38373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/39046 variables, 0/38373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39046/39046 variables, and 38373 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75090 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6982/6982 constraints, ReadFeed: 31309/31309 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6723/6894 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:04:59] [INFO ] Deduced a trap composed of 2 places in 641 ms of which 7 ms to minimize.
[2024-05-31 23:05:01] [INFO ] Deduced a trap composed of 2 places in 665 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6894 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6894 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 86/6980 variables, 43/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6980 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6980 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/6981 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6981 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 32064/39045 variables, 6981/7065 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39045 variables, 31309/38374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39045 variables, 3/38377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 39045/39046 variables, and 38377 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75146 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6981/6982 constraints, ReadFeed: 31309/31309 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 152910ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 171 out of 6982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6982/6982 places, 32099/32099 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6981 transition count 32098
Applied a total of 2 rules in 3789 ms. Remains 6981 /6982 variables (removed 1) and now considering 32098/32099 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3798 ms. Remains : 6981/6982 places, 32098/32099 transitions.
RANDOM walk for 40000 steps (77 resets) in 1686 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 62326 steps, run timeout after 3002 ms. (steps per millisecond=20 ) properties seen :0 out of 6
Probabilistic random walk after 62326 steps, saw 56082 distinct states, run finished after 3007 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-31 23:06:20] [INFO ] Flow matrix only has 32063 transitions (discarded 35 similar events)
// Phase 1: matrix 32063 rows 6981 cols
[2024-05-31 23:06:22] [INFO ] Computed 82 invariants in 2068 ms
[2024-05-31 23:06:22] [INFO ] State equation strengthened by 31311 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6722/6893 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6893 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 86/6979 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6979 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6979 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/6980 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6980 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 32063/39043 variables, 6980/7062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39043 variables, 31311/38373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39043 variables, 0/38373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/39044 variables, 1/38374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/39044 variables, 0/38374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/39044 variables, 0/38374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39044/39044 variables, and 38374 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69687 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6981/6981 constraints, ReadFeed: 31311/31311 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6722/6893 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 23:07:34] [INFO ] Deduced a trap composed of 2 places in 657 ms of which 8 ms to minimize.
[2024-05-31 23:07:36] [INFO ] Deduced a trap composed of 2 places in 679 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6893 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6893 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 86/6979 variables, 43/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6979 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6979 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/6980 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6980 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 32063/39043 variables, 6980/7064 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39043 variables, 31311/38375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39043 variables, 3/38378 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 39043/39044 variables, and 38378 constraints, problems are : Problem set: 0 solved, 6 unsolved in 90170 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6980/6981 constraints, ReadFeed: 31311/31311 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 162326ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 171 out of 6981 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6981/6981 places, 32098/32098 transitions.
Applied a total of 0 rules in 1932 ms. Remains 6981 /6981 variables (removed 0) and now considering 32098/32098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1932 ms. Remains : 6981/6981 places, 32098/32098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6981/6981 places, 32098/32098 transitions.
Applied a total of 0 rules in 1898 ms. Remains 6981 /6981 variables (removed 0) and now considering 32098/32098 (removed 0) transitions.
[2024-05-31 23:09:06] [INFO ] Flow matrix only has 32063 transitions (discarded 35 similar events)
[2024-05-31 23:09:06] [INFO ] Invariant cache hit.
[2024-05-31 23:09:19] [INFO ] Implicit Places using invariants in 12347 ms returned []
Implicit Place search using SMT only with invariants took 12358 ms to find 0 implicit places.
Running 32018 sub problems to find dead transitions.
[2024-05-31 23:09:19] [INFO ] Flow matrix only has 32063 transitions (discarded 35 similar events)
[2024-05-31 23:09:19] [INFO ] Invariant cache hit.
[2024-05-31 23:09:19] [INFO ] State equation strengthened by 31311 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6980 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 32018 unsolved
SMT process timed out in 146451ms, After SMT, problems are : Problem set: 0 solved, 32018 unsolved
Search for dead transitions found 0 dead transitions in 146784ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161152 ms. Remains : 6981/6981 places, 32098/32098 transitions.
[2024-05-31 23:11:46] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-31 23:11:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6981 places, 32098 transitions and 127684 arcs took 107 ms.
[2024-05-31 23:11:47] [INFO ] Flatten gal took : 1187 ms
Total runtime 635212 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-080-ReachabilityFireability-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityFireability-2023-09
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityFireability-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityFireability-2023-11
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityFireability-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-080-ReachabilityFireability-2023-15
BK_STOP 1717197108078
--------------------
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 CANInsertWithFailure-PT-080-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/583/inv_0_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityFireability-2023-09
rfs formula type EF
rfs formula formula --invariant=/tmp/583/inv_1_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/583/inv_2_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityFireability-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/583/inv_3_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityFireability-2023-13
rfs formula type EF
rfs formula formula --invariant=/tmp/583/inv_4_
rfs formula name CANInsertWithFailure-PT-080-ReachabilityFireability-2023-15
rfs formula type EF
rfs formula formula --invariant=/tmp/583/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="CANInsertWithFailure-PT-080"
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 CANInsertWithFailure-PT-080, 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 r476-tall-171620505300159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-080.tgz
mv CANInsertWithFailure-PT-080 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 ;