About the Execution of LTSMin+red for CANInsertWithFailure-PT-070
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7592.939 | 381246.00 | 464738.00 | 774.70 | FT?FTF?F?TF???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-171620505200150.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-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505200150
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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 30M 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-070-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717194799261
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-070
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:33:21] [INFO ] Load time of PNML (sax parser for PT used): 828 ms
[2024-05-31 22:33:21] [INFO ] Transformed 10644 places.
[2024-05-31 22:33:21] [INFO ] Transformed 29820 transitions.
[2024-05-31 22:33:21] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 1028 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (21 resets) in 3605 ms. (11 steps per ms) remains 11/16 properties
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
// Phase 1: matrix 29820 rows 10644 cols
[2024-05-31 22:33:29] [INFO ] Computed 73 invariants in 5898 ms
[2024-05-31 22:33:29] [INFO ] State equation strengthened by 9730 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-14 is UNSAT
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 10381/10515 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10515 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 124/10639 variables, 62/70 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10639 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/10641 variables, 2/72 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10641/40464 variables, and 72 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 70/71 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/10644 constraints, ReadFeed: 0/9730 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/131 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10382/10513 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 22:33:36] [INFO ] Deduced a trap composed of 5 places in 478 ms of which 39 ms to minimize.
[2024-05-31 22:33:37] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 3 ms to minimize.
[2024-05-31 22:33:37] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 3 ms to minimize.
[2024-05-31 22:33:38] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 3 ms to minimize.
[2024-05-31 22:33:38] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 3 ms to minimize.
[2024-05-31 22:33:39] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 3 ms to minimize.
[2024-05-31 22:33:39] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 3 ms to minimize.
[2024-05-31 22:33:40] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 3 ms to minimize.
SMT process timed out in 16501ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 131 out of 10644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Graph (complete) has 40251 edges and 10644 vertex of which 10643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.46 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 476 place count 10643 transition count 29345
Reduce places removed 475 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 478 rules applied. Total rules applied 954 place count 10168 transition count 29342
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 957 place count 10165 transition count 29342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 957 place count 10165 transition count 29338
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 965 place count 10161 transition count 29338
Performed 4435 Post agglomeration using F-continuation condition.Transition count delta: 4435
Deduced a syphon composed of 4435 places in 34 ms
Reduce places removed 4435 places and 0 transitions.
Iterating global reduction 3 with 8870 rules applied. Total rules applied 9835 place count 5726 transition count 24903
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9838 place count 5726 transition count 24900
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 9841 place count 5723 transition count 24900
Partial Free-agglomeration rule applied 5511 times.
Drop transitions (Partial Free agglomeration) removed 5511 transitions
Iterating global reduction 4 with 5511 rules applied. Total rules applied 15352 place count 5723 transition count 24900
Partial Free-agglomeration rule applied 296 times.
Drop transitions (Partial Free agglomeration) removed 296 transitions
Iterating global reduction 4 with 296 rules applied. Total rules applied 15648 place count 5723 transition count 24900
Applied a total of 15648 rules in 10826 ms. Remains 5723 /10644 variables (removed 4921) and now considering 24900/29820 (removed 4920) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10847 ms. Remains : 5723/10644 places, 24900/29820 transitions.
RANDOM walk for 40000 steps (86 resets) in 2508 ms. (15 steps per ms) remains 7/10 properties
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
[2024-05-31 22:33:51] [INFO ] Flow matrix only has 24844 transitions (discarded 56 similar events)
// Phase 1: matrix 24844 rows 5723 cols
[2024-05-31 22:33:53] [INFO ] Computed 72 invariants in 1614 ms
[2024-05-31 22:33:53] [INFO ] State equation strengthened by 23558 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5466/5593 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5593 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 126/5719 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5719 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/5721 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5721 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 24844/30565 variables, 5721/5793 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30565 variables, 23558/29351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30565 variables, 0/29351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/30567 variables, 2/29353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30567 variables, 0/29353 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 30567/30567 variables, and 29353 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45060 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5723/5723 constraints, ReadFeed: 23558/23558 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5466/5593 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:34:39] [INFO ] Deduced a trap composed of 2 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5593 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5593 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 126/5719 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5719 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/5721 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:34:52] [INFO ] Deduced a trap composed of 82 places in 8743 ms of which 32 ms to minimize.
[2024-05-31 22:35:00] [INFO ] Deduced a trap composed of 80 places in 8380 ms of which 31 ms to minimize.
[2024-05-31 22:35:09] [INFO ] Deduced a trap composed of 165 places in 8563 ms of which 31 ms to minimize.
[2024-05-31 22:35:16] [INFO ] Deduced a trap composed of 77 places in 7615 ms of which 31 ms to minimize.
[2024-05-31 22:35:24] [INFO ] Deduced a trap composed of 78 places in 7567 ms of which 31 ms to minimize.
SMT process timed out in 92661ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 127 out of 5723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5723/5723 places, 24900/24900 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5721 transition count 24898
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 5721 transition count 24897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 5720 transition count 24897
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 5720 transition count 24897
Applied a total of 8 rules in 4502 ms. Remains 5720 /5723 variables (removed 3) and now considering 24897/24900 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4502 ms. Remains : 5720/5723 places, 24897/24900 transitions.
RANDOM walk for 40000 steps (86 resets) in 1633 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 106470 steps, run timeout after 3002 ms. (steps per millisecond=35 ) properties seen :0 out of 7
Probabilistic random walk after 106470 steps, saw 101178 distinct states, run finished after 3006 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-31 22:35:32] [INFO ] Flow matrix only has 24842 transitions (discarded 55 similar events)
// Phase 1: matrix 24842 rows 5720 cols
[2024-05-31 22:35:34] [INFO ] Computed 72 invariants in 1510 ms
[2024-05-31 22:35:34] [INFO ] State equation strengthened by 23565 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5463/5590 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5590 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 126/5716 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5716 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/5718 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5718 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 24842/30560 variables, 5718/5790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30560 variables, 23565/29355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30560 variables, 0/29355 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/30562 variables, 2/29357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/30562 variables, 0/29357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/30562 variables, 0/29357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30562/30562 variables, and 29357 constraints, problems are : Problem set: 0 solved, 7 unsolved in 43542 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5720/5720 constraints, ReadFeed: 23565/23565 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5463/5590 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 2 ms to minimize.
[2024-05-31 22:36:19] [INFO ] Deduced a trap composed of 2 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5590 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5590 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 126/5716 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5716 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/5718 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 22:36:31] [INFO ] Deduced a trap composed of 91 places in 8997 ms of which 36 ms to minimize.
[2024-05-31 22:36:40] [INFO ] Deduced a trap composed of 86 places in 8082 ms of which 36 ms to minimize.
[2024-05-31 22:36:48] [INFO ] Deduced a trap composed of 82 places in 8403 ms of which 34 ms to minimize.
[2024-05-31 22:36:56] [INFO ] Deduced a trap composed of 94 places in 8175 ms of which 34 ms to minimize.
[2024-05-31 22:37:05] [INFO ] Deduced a trap composed of 94 places in 8590 ms of which 33 ms to minimize.
[2024-05-31 22:37:12] [INFO ] Deduced a trap composed of 97 places in 7516 ms of which 33 ms to minimize.
[2024-05-31 22:37:21] [INFO ] Deduced a trap composed of 95 places in 8541 ms of which 32 ms to minimize.
[2024-05-31 22:37:29] [INFO ] Deduced a trap composed of 97 places in 8199 ms of which 34 ms to minimize.
[2024-05-31 22:37:37] [INFO ] Deduced a trap composed of 86 places in 7970 ms of which 33 ms to minimize.
SMT process timed out in 124985ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 127 out of 5720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5720/5720 places, 24897/24897 transitions.
Applied a total of 0 rules in 1001 ms. Remains 5720 /5720 variables (removed 0) and now considering 24897/24897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1001 ms. Remains : 5720/5720 places, 24897/24897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5720/5720 places, 24897/24897 transitions.
Applied a total of 0 rules in 990 ms. Remains 5720 /5720 variables (removed 0) and now considering 24897/24897 (removed 0) transitions.
[2024-05-31 22:37:39] [INFO ] Flow matrix only has 24842 transitions (discarded 55 similar events)
[2024-05-31 22:37:39] [INFO ] Invariant cache hit.
[2024-05-31 22:37:52] [INFO ] Implicit Places using invariants in 12110 ms returned []
Implicit Place search using SMT only with invariants took 12118 ms to find 0 implicit places.
Running 24827 sub problems to find dead transitions.
[2024-05-31 22:37:52] [INFO ] Flow matrix only has 24842 transitions (discarded 55 similar events)
[2024-05-31 22:37:52] [INFO ] Invariant cache hit.
[2024-05-31 22:37:52] [INFO ] State equation strengthened by 23565 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5719 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 24827 unsolved
SMT process timed out in 106570ms, After SMT, problems are : Problem set: 0 solved, 24827 unsolved
Search for dead transitions found 0 dead transitions in 106781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119956 ms. Remains : 5720/5720 places, 24897/24897 transitions.
[2024-05-31 22:39:38] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 22:39:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5720 places, 24897 transitions and 98227 arcs took 85 ms.
[2024-05-31 22:39:40] [INFO ] Flatten gal took : 824 ms
Total runtime 379665 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-070-ReachabilityCardinality-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-06
Could not compute solution for formula : CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-11
Could not compute solution for formula : CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-12
Could not compute solution for formula : CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-15
BK_STOP 1717195180507
--------------------
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-070-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/622/inv_0_
rfs formula name CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-06
rfs formula type AG
rfs formula formula --invariant=/tmp/622/inv_1_
rfs formula name CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/622/inv_2_
rfs formula name CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-11
rfs formula type AG
rfs formula formula --invariant=/tmp/622/inv_3_
rfs formula name CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/622/inv_4_
rfs formula name CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-13
rfs formula type EF
rfs formula formula --invariant=/tmp/622/inv_5_
rfs formula name CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-15
rfs formula type EF
rfs formula formula --invariant=/tmp/622/inv_6_
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-070"
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-070, 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-171620505200150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-070.tgz
mv CANInsertWithFailure-PT-070 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 ;