Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455700138.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717269525978

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 19:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:18:47] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-01 19:18:47] [INFO ] Transformed 476 places.
[2024-06-01 19:18:47] [INFO ] Transformed 920 transitions.
[2024-06-01 19:18:47] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 225 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (9 resets) in 2265 ms. (17 steps per ms) remains 14/476 properties
BEST_FIRST walk for 40003 steps (9 resets) in 270 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 720 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 467 ms. (85 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 262 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 288 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 308 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 136 ms. (291 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (9 resets) in 124 ms. (320 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (10 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (8 resets) in 153 ms. (259 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (12 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
[2024-06-01 19:18:49] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-06-01 19:18:49] [INFO ] Computed 46 invariants in 34 ms
[2024-06-01 19:18:49] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 196/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 85/295 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 175/472 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/473 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/474 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 812/1286 variables, 474/519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1286 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 2/1288 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1288 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 594 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2837 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 196/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 85/295 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 175/472 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 23 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:18:53] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/473 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/474 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 812/1286 variables, 474/523 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1286/1288 variables, and 595 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 474/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 4/4 constraints]
After SMT, in 7958ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 302 place count 324 transition count 674
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 314 place count 324 transition count 662
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 326 place count 312 transition count 662
Applied a total of 326 rules in 219 ms. Remains 312 /476 variables (removed 164) and now considering 662/824 (removed 162) transitions.
Running 660 sub problems to find dead transitions.
[2024-06-01 19:18:57] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
// Phase 1: matrix 650 rows 312 cols
[2024-06-01 19:18:57] [INFO ] Computed 44 invariants in 15 ms
[2024-06-01 19:18:57] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 3 ms to minimize.
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:19:02] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:19:03] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:19:03] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:19:04] [INFO ] Deduced a trap composed of 152 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:19:05] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:19:06] [INFO ] Deduced a trap composed of 110 places in 234 ms of which 3 ms to minimize.
[2024-06-01 19:19:06] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 134 places in 183 ms of which 2 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 149 places in 177 ms of which 2 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 126 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:19:07] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2024-06-01 19:19:08] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-01 19:19:10] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 117 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 159 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 179 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 180 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 1 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 174 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 (/ 2.0 3.0))
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 2.0 3.0))
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 (/ 1.0 3.0))
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 9.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 3.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/962 variables, and 66 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-01 19:19:37] [INFO ] Deduced a trap composed of 121 places in 190 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/962 variables, and 68 constraints, problems are : Problem set: 0 solved, 660 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/312 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 27/27 constraints]
After SMT, in 41291ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 41307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41549 ms. Remains : 312/476 places, 662/824 transitions.
RANDOM walk for 4000000 steps (2412 resets) in 40011 ms. (99 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3729320 steps (951 resets) in 20005 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3659778 steps (819 resets) in 20007 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3979807 steps (1023 resets) in 17609 ms. (225 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3853693 steps (950 resets) in 16107 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3759614 steps (933 resets) in 16149 ms. (232 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3878794 steps (921 resets) in 16255 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (978 resets) in 14971 ms. (267 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3780463 steps (910 resets) in 16148 ms. (234 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3828090 steps (923 resets) in 15814 ms. (242 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3893000 steps (938 resets) in 16692 ms. (233 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3961075 steps (1010 resets) in 15850 ms. (249 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3963227 steps (958 resets) in 16187 ms. (244 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3867617 steps (961 resets) in 16544 ms. (233 steps per ms) remains 14/14 properties
BEST_FIRST walk for 3562876 steps (885 resets) in 15953 ms. (223 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 11210331 steps, run timeout after 243012 ms. (steps per millisecond=46 ) properties seen :0 out of 14
Probabilistic random walk after 11210331 steps, saw 4893869 distinct states, run finished after 243020 ms. (steps per millisecond=46 ) properties seen :0
[2024-06-01 19:25:03] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2024-06-01 19:25:03] [INFO ] Invariant cache hit.
[2024-06-01 19:25:03] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 146/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 55/215 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 91/308 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2/310 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 650/960 variables, 310/353 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/960 variables, 72/425 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 2/962 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/962 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/962 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 428 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 312/312 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 146/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 55/215 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 91/308 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 3 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 3 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 8 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 125 places in 194 ms of which 2 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 134 places in 222 ms of which 3 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 118 places in 204 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 650/960 variables, 310/362 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/960 variables, 72/434 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem smplace_36 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 6977ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 662/662 transitions.
Applied a total of 0 rules in 38 ms. Remains 312 /312 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 312/312 places, 662/662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 662/662 transitions.
Applied a total of 0 rules in 30 ms. Remains 312 /312 variables (removed 0) and now considering 662/662 (removed 0) transitions.
[2024-06-01 19:25:10] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
[2024-06-01 19:25:10] [INFO ] Invariant cache hit.
[2024-06-01 19:25:10] [INFO ] Implicit Places using invariants in 406 ms returned [79, 157, 178, 180, 275, 286]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 415 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/312 places, 662/662 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 302 transition count 658
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 302 transition count 658
Applied a total of 8 rules in 29 ms. Remains 302 /306 variables (removed 4) and now considering 658/662 (removed 4) transitions.
[2024-06-01 19:25:10] [INFO ] Flow matrix only has 646 transitions (discarded 12 similar events)
// Phase 1: matrix 646 rows 302 cols
[2024-06-01 19:25:10] [INFO ] Computed 38 invariants in 21 ms
[2024-06-01 19:25:11] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 19:25:11] [INFO ] Flow matrix only has 646 transitions (discarded 12 similar events)
[2024-06-01 19:25:11] [INFO ] Invariant cache hit.
[2024-06-01 19:25:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 19:25:14] [INFO ] Implicit Places using invariants and state equation in 3332 ms returned []
Implicit Place search using SMT with State Equation took 3685 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 302/312 places, 658/662 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4160 ms. Remains : 302/312 places, 658/662 transitions.
Total runtime 387329 ms.
ITS solved all properties within timeout

BK_STOP 1717269914990

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 PolyORBLF-PT-S02J04T06, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455700138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;