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-171620505300174.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-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505300174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K 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 60M 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-100-ReachabilityCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-06
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-07
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-10
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-14
FORMULA_NAME CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717199836405

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-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:57:19] [INFO ] Load time of PNML (sax parser for PT used): 1302 ms
[2024-05-31 23:57:19] [INFO ] Transformed 21204 places.
[2024-05-31 23:57:19] [INFO ] Transformed 60600 transitions.
[2024-05-31 23:57:19] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1580 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 (12 resets) in 3461 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 252 ms. (15 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 58517 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 16
Probabilistic random walk after 58517 steps, saw 57778 distinct states, run finished after 3023 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 60600 rows 21204 cols
[2024-05-31 23:57:51] [INFO ] Computed 103 invariants in 26905 ms
[2024-05-31 23:57:51] [INFO ] State equation strengthened by 19900 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 20742/21021 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21021/81804 variables, and 11 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5092 ms.
Refiners :[Positive P Invariants (semi-flows): 11/101 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/21204 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 16/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 20742/21021 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-31 23:58:02] [INFO ] Deduced a trap composed of 5 places in 1039 ms of which 37 ms to minimize.
SMT process timed out in 38081ms, After SMT, problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 279 out of 21204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Graph (complete) has 81501 edges and 21204 vertex of which 21203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.60 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 671 transitions
Trivial Post-agglo rules discarded 671 transitions
Performed 671 trivial Post agglomeration. Transition count delta: 671
Iterating post reduction 0 with 671 rules applied. Total rules applied 672 place count 21203 transition count 59929
Reduce places removed 671 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 682 rules applied. Total rules applied 1354 place count 20532 transition count 59918
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1365 place count 20521 transition count 59918
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1365 place count 20521 transition count 59916
Deduced a syphon composed of 2 places in 28 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1369 place count 20519 transition count 59916
Performed 9098 Post agglomeration using F-continuation condition.Transition count delta: 9098
Deduced a syphon composed of 9098 places in 57 ms
Reduce places removed 9098 places and 0 transitions.
Iterating global reduction 3 with 18196 rules applied. Total rules applied 19565 place count 11421 transition count 50818
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 19574 place count 11421 transition count 50809
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 19583 place count 11412 transition count 50809
Partial Free-agglomeration rule applied 10910 times.
Drop transitions (Partial Free agglomeration) removed 10910 transitions
Iterating global reduction 4 with 10910 rules applied. Total rules applied 30493 place count 11412 transition count 50809
Partial Free-agglomeration rule applied 213 times.
Drop transitions (Partial Free agglomeration) removed 213 transitions
Iterating global reduction 4 with 213 rules applied. Total rules applied 30706 place count 11412 transition count 50809
Applied a total of 30706 rules in 35960 ms. Remains 11412 /21204 variables (removed 9792) and now considering 50809/60600 (removed 9791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35978 ms. Remains : 11412/21204 places, 50809/60600 transitions.
RANDOM walk for 40000 steps (60 resets) in 4173 ms. (9 steps per ms) remains 13/16 properties
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
[2024-05-31 23:58:40] [INFO ] Flow matrix only has 50686 transitions (discarded 123 similar events)
// Phase 1: matrix 50686 rows 11412 cols
[2024-05-31 23:58:51] [INFO ] Computed 102 invariants in 11377 ms
[2024-05-31 23:58:52] [INFO ] State equation strengthened by 47578 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10957/11230 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11230 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 178/11408 variables, 89/100 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11408 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/11410 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11410 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 50686/62096 variables, 11410/11512 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 57249ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 273 out of 11412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11412/11412 places, 50809/50809 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11411 transition count 50808
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 11411 transition count 50808
Applied a total of 7 rules in 13485 ms. Remains 11411 /11412 variables (removed 1) and now considering 50808/50809 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13485 ms. Remains : 11411/11412 places, 50808/50809 transitions.
RANDOM walk for 40000 steps (60 resets) in 2354 ms. (16 steps per ms) remains 11/13 properties
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 166 ms. (239 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 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
[2024-05-31 23:59:52] [INFO ] Flow matrix only has 50690 transitions (discarded 118 similar events)
// Phase 1: matrix 50690 rows 11411 cols
[2024-06-01 00:00:05] [INFO ] Computed 102 invariants in 13390 ms
[2024-06-01 00:00:06] [INFO ] State equation strengthened by 47590 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10978/11229 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11229 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 178/11407 variables, 89/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11407 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/11409 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11409 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 50690/62099 variables, 11409/11511 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 62099/62101 variables, and 59101 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75057 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11409/11411 constraints, ReadFeed: 47590/47590 constraints, PredecessorRefiner: 11/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10978/11229 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:01:24] [INFO ] Deduced a trap composed of 2 places in 536 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11229 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11229 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 178/11407 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11407 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/11409 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:02:20] [INFO ] Deduced a trap composed of 139 places in 40146 ms of which 82 ms to minimize.
[2024-06-01 00:02:58] [INFO ] Deduced a trap composed of 133 places in 38233 ms of which 69 ms to minimize.
SMT process timed out in 186483ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 251 out of 11411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11411/11411 places, 50808/50808 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 10 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 11399 transition count 50796
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 35 place count 11399 transition count 50796
Applied a total of 35 rules in 13695 ms. Remains 11399 /11411 variables (removed 12) and now considering 50796/50808 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13697 ms. Remains : 11399/11411 places, 50796/50808 transitions.
RANDOM walk for 40000 steps (60 resets) in 2309 ms. (17 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 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 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 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 59351 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 11
Probabilistic random walk after 59351 steps, saw 58083 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
[2024-06-01 00:03:16] [INFO ] Flow matrix only has 50686 transitions (discarded 110 similar events)
// Phase 1: matrix 50686 rows 11399 cols
[2024-06-01 00:03:29] [INFO ] Computed 102 invariants in 12988 ms
[2024-06-01 00:03:30] [INFO ] State equation strengthened by 47632 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10966/11217 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11217 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 178/11395 variables, 89/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11395 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/11397 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11397 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 50686/62083 variables, 11397/11499 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62083 variables, 47632/59131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 62083/62085 variables, and 59131 constraints, problems are : Problem set: 0 solved, 11 unsolved in 90079 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11397/11399 constraints, ReadFeed: 47632/47632 constraints, PredecessorRefiner: 11/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10966/11217 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:05:03] [INFO ] Deduced a trap composed of 2 places in 571 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11217 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11217 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 178/11395 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11395 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/11397 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:05:57] [INFO ] Deduced a trap composed of 119 places in 38544 ms of which 68 ms to minimize.
[2024-06-01 00:06:35] [INFO ] Deduced a trap composed of 125 places in 37562 ms of which 77 ms to minimize.
SMT process timed out in 198651ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 251 out of 11399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11399/11399 places, 50796/50796 transitions.
Applied a total of 0 rules in 4837 ms. Remains 11399 /11399 variables (removed 0) and now considering 50796/50796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4837 ms. Remains : 11399/11399 places, 50796/50796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11399/11399 places, 50796/50796 transitions.
Applied a total of 0 rules in 4538 ms. Remains 11399 /11399 variables (removed 0) and now considering 50796/50796 (removed 0) transitions.
[2024-06-01 00:06:44] [INFO ] Flow matrix only has 50686 transitions (discarded 110 similar events)
[2024-06-01 00:06:44] [INFO ] Invariant cache hit.
[2024-06-01 00:07:16] [INFO ] Performed 594/11399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:07:25] [INFO ] Implicit Places using invariants in 40337 ms returned []
Implicit Place search using SMT only with invariants took 40346 ms to find 0 implicit places.
Running 50696 sub problems to find dead transitions.
[2024-06-01 00:07:25] [INFO ] Flow matrix only has 50686 transitions (discarded 110 similar events)
[2024-06-01 00:07:25] [INFO ] Invariant cache hit.
[2024-06-01 00:07:26] [INFO ] State equation strengthened by 47632 read => feed constraints.
SMT process timed out in 386037ms, After SMT, problems are : Problem set: 0 solved, 50696 unsolved
Search for dead transitions found 0 dead transitions in 386475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431515 ms. Remains : 11399/11399 places, 50796/50796 transitions.
[2024-06-01 00:13:51] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 00:13:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11399 places, 50796 transitions and 199862 arcs took 156 ms.
[2024-06-01 00:13:53] [INFO ] Flatten gal took : 1441 ms
Total runtime 996290 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-04
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-06
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-07
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-10
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-11
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-13
Could not compute solution for formula : CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-14

BK_STOP 1717200834360

--------------------
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-100-ReachabilityCardinality-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/596/inv_0_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_1_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_2_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-06
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_3_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-07
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_4_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_5_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/596/inv_6_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-10
rfs formula type AG
rfs formula formula --invariant=/tmp/596/inv_7_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_8_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/596/inv_9_
rfs formula name CANInsertWithFailure-PT-100-ReachabilityCardinality-2023-14
rfs formula type AG
rfs formula formula --invariant=/tmp/596/inv_10_
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-100"
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-100, 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-171620505300174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-100.tgz
mv CANInsertWithFailure-PT-100 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;