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.r538-tall-171690547400082.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 StigmergyCommit-PT-04b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r538-tall-171690547400082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K 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 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 627K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717226393181

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:19:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 07:19:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:19:54] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2024-06-01 07:19:54] [INFO ] Transformed 1534 places.
[2024-06-01 07:19:54] [INFO ] Transformed 2136 transitions.
[2024-06-01 07:19:54] [INFO ] Found NUPN structural information;
[2024-06-01 07:19:54] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 354 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1523 edges and 1534 vertex of which 105 / 1534 are part of one of the 15 SCC in 10 ms
Free SCC test removed 90 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1152 transitions
Trivial Post-agglo rules discarded 1152 transitions
Performed 1152 trivial Post agglomeration. Transition count delta: 1152
Iterating post reduction 0 with 1152 rules applied. Total rules applied 1153 place count 1444 transition count 884
Reduce places removed 1152 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 1172 rules applied. Total rules applied 2325 place count 292 transition count 864
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 2330 place count 287 transition count 864
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 2330 place count 287 transition count 809
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2440 place count 232 transition count 809
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2588 place count 158 transition count 735
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 2612 place count 146 transition count 753
Applied a total of 2612 rules in 145 ms. Remains 146 /1534 variables (removed 1388) and now considering 753/2136 (removed 1383) transitions.
[2024-06-01 07:19:54] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
// Phase 1: matrix 738 rows 146 cols
[2024-06-01 07:19:54] [INFO ] Computed 6 invariants in 27 ms
[2024-06-01 07:19:55] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-01 07:19:55] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2024-06-01 07:19:55] [INFO ] Invariant cache hit.
[2024-06-01 07:19:55] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 07:19:55] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-06-01 07:19:55] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2024-06-01 07:19:55] [INFO ] Invariant cache hit.
[2024-06-01 07:19:56] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 6/151 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 12 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 1 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 1 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 1 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 6 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 1 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 1 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 1 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 1 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 1 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 1 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 1 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 1 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 1 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 17/189 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 1 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 1 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 7/196 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 1 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
SMT process timed out in 32949ms, After SMT, problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 32977ms
Starting structural reductions in LIVENESS mode, iteration 1 : 146/1534 places, 753/2136 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 34219 ms. Remains : 146/1534 places, 753/2136 transitions.
Discarding 122 transitions out of 753. Remains 631
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4938 resets) in 3292 ms. (12 steps per ms) remains 592/630 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 592/592 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 592/592 properties
Probabilistic random walk after 30001 steps, saw 9428 distinct states, run finished after 632 ms. (steps per millisecond=47 ) properties seen :126
[2024-06-01 07:20:30] [INFO ] Flow matrix only has 738 transitions (discarded 15 similar events)
[2024-06-01 07:20:30] [INFO ] Invariant cache hit.
[2024-06-01 07:20:30] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 43/146 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 43/152 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 1 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 146/884 variables, and 161 constraints, problems are : Problem set: 0 solved, 466 unsolved in 5022 ms.
Refiners :[Domain max(s): 146/146 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/146 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 43/146 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 43/152 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 1 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 0 ms to minimize.
SMT process timed out in 11820ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 103 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 753/753 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 146 transition count 737
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 141 transition count 732
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 141 transition count 732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 136 transition count 727
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 136 transition count 727
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 131 transition count 722
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 131 transition count 722
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 67 place count 131 transition count 701
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 87 place count 131 transition count 681
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 131 transition count 679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 679
Applied a total of 91 rules in 127 ms. Remains 129 /146 variables (removed 17) and now considering 679/753 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 129/146 places, 679/753 transitions.
RANDOM walk for 4000000 steps (440125 resets) in 74125 ms. (53 steps per ms) remains 73/466 properties
BEST_FIRST walk for 400004 steps (4565 resets) in 896 ms. (445 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (4564 resets) in 969 ms. (412 steps per ms) remains 71/73 properties
BEST_FIRST walk for 400004 steps (3363 resets) in 330 ms. (1208 steps per ms) remains 66/71 properties
BEST_FIRST walk for 400004 steps (28 resets) in 548 ms. (728 steps per ms) remains 65/66 properties
BEST_FIRST walk for 400004 steps (44 resets) in 448 ms. (890 steps per ms) remains 64/65 properties
BEST_FIRST walk for 400003 steps (46 resets) in 517 ms. (772 steps per ms) remains 63/64 properties
BEST_FIRST walk for 400003 steps (74 resets) in 450 ms. (886 steps per ms) remains 62/63 properties
BEST_FIRST walk for 400003 steps (3397 resets) in 295 ms. (1351 steps per ms) remains 59/62 properties
BEST_FIRST walk for 400004 steps (2132 resets) in 431 ms. (925 steps per ms) remains 57/59 properties
BEST_FIRST walk for 400002 steps (30 resets) in 352 ms. (1133 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400002 steps (45 resets) in 432 ms. (923 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400003 steps (84 resets) in 393 ms. (1015 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400004 steps (46 resets) in 558 ms. (715 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400003 steps (17 resets) in 423 ms. (943 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400004 steps (53 resets) in 426 ms. (936 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400003 steps (38 resets) in 419 ms. (952 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400004 steps (2243 resets) in 225 ms. (1769 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400003 steps (30 resets) in 415 ms. (961 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400003 steps (53 resets) in 332 ms. (1201 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400003 steps (24 resets) in 634 ms. (629 steps per ms) remains 46/47 properties
BEST_FIRST walk for 400004 steps (68 resets) in 249 ms. (1600 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400004 steps (140 resets) in 241 ms. (1652 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400004 steps (23 resets) in 239 ms. (1666 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400003 steps (34 resets) in 313 ms. (1273 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (39 resets) in 317 ms. (1257 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400004 steps (82 resets) in 406 ms. (982 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400004 steps (51 resets) in 390 ms. (1023 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400004 steps (66 resets) in 391 ms. (1020 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400003 steps (38 resets) in 358 ms. (1114 steps per ms) remains 37/38 properties
BEST_FIRST walk for 400003 steps (49 resets) in 410 ms. (973 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400004 steps (70 resets) in 333 ms. (1197 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400004 steps (50 resets) in 519 ms. (769 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400004 steps (59 resets) in 305 ms. (1307 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400004 steps (18 resets) in 301 ms. (1324 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400004 steps (49 resets) in 225 ms. (1769 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (46 resets) in 365 ms. (1092 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (2660 resets) in 289 ms. (1379 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (2649 resets) in 291 ms. (1369 steps per ms) remains 26/30 properties
BEST_FIRST walk for 400003 steps (2635 resets) in 291 ms. (1369 steps per ms) remains 22/26 properties
BEST_FIRST walk for 400004 steps (2649 resets) in 310 ms. (1286 steps per ms) remains 19/22 properties
BEST_FIRST walk for 400004 steps (2665 resets) in 292 ms. (1365 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2652 resets) in 289 ms. (1379 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2676 resets) in 489 ms. (816 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2646 resets) in 279 ms. (1428 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2642 resets) in 279 ms. (1428 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (2657 resets) in 283 ms. (1408 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2647 resets) in 281 ms. (1418 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (2646 resets) in 275 ms. (1449 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2673 resets) in 289 ms. (1379 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2649 resets) in 284 ms. (1403 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2643 resets) in 293 ms. (1360 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (2642 resets) in 273 ms. (1459 steps per ms) remains 13/19 properties
BEST_FIRST walk for 400004 steps (2651 resets) in 242 ms. (1646 steps per ms) remains 13/13 properties
// Phase 1: matrix 679 rows 129 cols
[2024-06-01 07:21:07] [INFO ] Computed 6 invariants in 6 ms
[2024-06-01 07:21:07] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 115/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 679/808 variables, 129/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 85/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/808 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 220 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 129/129 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 115/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 679/808 variables, 129/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/808 variables, 85/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 1 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/808 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 237 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 129/129 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 2775ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1972 ms.
Support contains 14 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 679/679 transitions.
Graph (complete) has 535 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 124 transition count 674
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 35 place count 95 transition count 224
Iterating global reduction 1 with 29 rules applied. Total rules applied 64 place count 95 transition count 224
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 77 place count 95 transition count 211
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 84 transition count 200
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 84 transition count 200
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 79 transition count 195
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 79 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 79 transition count 193
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 121 place count 74 transition count 188
Free-agglomeration rule applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 149 place count 74 transition count 160
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 210 place count 46 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 240 place count 46 transition count 97
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 248 place count 46 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 253 place count 46 transition count 92
Applied a total of 253 rules in 65 ms. Remains 46 /129 variables (removed 83) and now considering 92/679 (removed 587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 46/129 places, 92/679 transitions.
RANDOM walk for 16285 steps (559 resets) in 77 ms. (208 steps per ms) remains 0/13 properties
Able to resolve query QuasiLiveness after proving 631 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 77913 ms.
ITS solved all properties within timeout

BK_STOP 1717226472267

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -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="StigmergyCommit-PT-04b"
export BK_EXAMINATION="QuasiLiveness"
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 StigmergyCommit-PT-04b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r538-tall-171690547400082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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