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-171654455500049.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-COL-S02J04T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455500049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 Liveness

=== Now, execution of the tool begins

BK_START 1717269283715

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:14:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 19:14:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 19:14:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 745 ms
[2024-06-01 19:14:46] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 28 ms.
[2024-06-01 19:14:46] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 19:14:46] [INFO ] Skeletonized 0 HLPN properties in 1 ms.
[2024-06-01 19:14:46] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 40 ms.
[2024-06-01 19:14:46] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-06-01 19:14:46] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 25 ms.
[2024-06-01 19:14:46] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2024-06-01 19:14:46] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 19:14:46] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 19:14:46] [INFO ] Reduced 66 identical enabling conditions.
[2024-06-01 19:14:46] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 0 ms.
[2024-06-01 19:14:46] [INFO ] Skeletonized 65 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 19:14:46] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 12 ms.
[2024-06-01 19:14:46] [INFO ] Unfolded 65 HLPN properties in 0 ms.
[2024-06-01 19:14:46] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 19:14:46] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 19:14:46] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.31802KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 66 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2024-06-01 19:14:46] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-06-01 19:14:46] [INFO ] Computed 46 invariants in 60 ms
[2024-06-01 19:14:46] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:14:53] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 12 ms to minimize.
[2024-06-01 19:14:53] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:14:54] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:14:54] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:14:54] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:14:54] [INFO ] Deduced a trap composed of 249 places in 319 ms of which 4 ms to minimize.
[2024-06-01 19:14:55] [INFO ] Deduced a trap composed of 125 places in 262 ms of which 3 ms to minimize.
[2024-06-01 19:14:55] [INFO ] Deduced a trap composed of 153 places in 278 ms of which 3 ms to minimize.
[2024-06-01 19:14:55] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:14:56] [INFO ] Deduced a trap composed of 273 places in 188 ms of which 4 ms to minimize.
[2024-06-01 19:14:56] [INFO ] Deduced a trap composed of 271 places in 258 ms of which 3 ms to minimize.
[2024-06-01 19:14:56] [INFO ] Deduced a trap composed of 283 places in 302 ms of which 3 ms to minimize.
[2024-06-01 19:14:56] [INFO ] Deduced a trap composed of 283 places in 241 ms of which 3 ms to minimize.
[2024-06-01 19:14:57] [INFO ] Deduced a trap composed of 248 places in 292 ms of which 3 ms to minimize.
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 238 places in 189 ms of which 4 ms to minimize.
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 223 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:15:03] [INFO ] Deduced a trap composed of 252 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.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 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.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 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.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 0.0)
(s120 0.0)
(s121 0.0)
(s122 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.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 0.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 1.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 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.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 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 59 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20123 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:15:13] [INFO ] Deduced a trap composed of 309 places in 278 ms of which 5 ms to minimize.
[2024-06-01 19:15:14] [INFO ] Deduced a trap composed of 314 places in 1199 ms of which 5 ms to minimize.
[2024-06-01 19:15:15] [INFO ] Deduced a trap composed of 328 places in 274 ms of which 5 ms to minimize.
[2024-06-01 19:15:15] [INFO ] Deduced a trap composed of 317 places in 230 ms of which 4 ms to minimize.
[2024-06-01 19:15:16] [INFO ] Deduced a trap composed of 311 places in 232 ms of which 5 ms to minimize.
[2024-06-01 19:15:16] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:15:17] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 4 ms to minimize.
[2024-06-01 19:15:19] [INFO ] Deduced a trap composed of 59 places in 327 ms of which 5 ms to minimize.
[2024-06-01 19:15:19] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 3 ms to minimize.
[2024-06-01 19:15:20] [INFO ] Deduced a trap composed of 254 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:15:20] [INFO ] Deduced a trap composed of 249 places in 202 ms of which 4 ms to minimize.
[2024-06-01 19:15:20] [INFO ] Deduced a trap composed of 242 places in 183 ms of which 2 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 243 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:15:27] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 2 ms to minimize.
SMT process timed out in 41404ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41445ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41554 ms. Remains : 476/476 places, 824/824 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 35 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2024-06-01 19:15:27] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-06-01 19:15:27] [INFO ] Invariant cache hit.
[2024-06-01 19:15:27] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 19:15:27] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-06-01 19:15:27] [INFO ] Invariant cache hit.
[2024-06-01 19:15:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 19:15:28] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-01 19:15:28] [INFO ] Redundant transitions in 62 ms returned []
Running 822 sub problems to find dead transitions.
[2024-06-01 19:15:28] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-06-01 19:15:28] [INFO ] Invariant cache hit.
[2024-06-01 19:15:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:15:34] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:15:34] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:15:34] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 5 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 4 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 217 places in 187 ms of which 2 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 133 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 255 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 279 places in 209 ms of which 2 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 232 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 280 places in 238 ms of which 4 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 265 places in 180 ms of which 2 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 254 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 244 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:15:38] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:15:43] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:15:44] [INFO ] Deduced a trap composed of 264 places in 239 ms of which 3 ms to minimize.
[2024-06-01 19:15:44] [INFO ] Deduced a trap composed of 321 places in 194 ms of which 2 ms to minimize.
[2024-06-01 19:15:44] [INFO ] Deduced a trap composed of 266 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 250 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:15:47] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 2 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 240 places in 185 ms of which 4 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 226 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:15:58] [INFO ] Deduced a trap composed of 271 places in 235 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 68 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 239 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 253 places in 222 ms of which 4 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 283 places in 160 ms of which 2 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 291 places in 168 ms of which 2 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 250 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 243 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 248 places in 180 ms of which 4 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 310 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:16:18] [INFO ] Deduced a trap composed of 236 places in 310 ms of which 6 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 281 places in 199 ms of which 4 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 285 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 273 places in 187 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 80 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 38/38 constraints]
After SMT, in 60981ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60993ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61640 ms. Remains : 476/476 places, 824/824 transitions.
Finished random walk after 3975 steps, including 0 resets, run found a deadlock after 17 ms. (steps per millisecond=233 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 104370 ms.
ITS solved all properties within timeout

BK_STOP 1717269389508

--------------------
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 Liveness -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-COL-S02J04T06"
export BK_EXAMINATION="Liveness"
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-COL-S02J04T06, examination is Liveness"
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-171654455500049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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