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.r534-smll-171683819400104.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 SimpleLoadBal-PT-10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r534-smll-171683819400104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 13 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K 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 1717250244959

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SimpleLoadBal-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:57:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:57:27] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2024-06-01 13:57:27] [INFO ] Transformed 104 places.
[2024-06-01 13:57:27] [INFO ] Transformed 605 transitions.
[2024-06-01 13:57:27] [INFO ] Found NUPN structural information;
[2024-06-01 13:57:27] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2024-06-01 13:57:27] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 547 ms.
Built sparse matrix representations for Structural reductions in 11 ms.21314KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 104/104 places, 605/605 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 110 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 133 ms. Remains : 104/104 places, 605/605 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 104/104 places, 605/605 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 48 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2024-06-01 13:57:28] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2024-06-01 13:57:28] [INFO ] Computed 29 invariants in 57 ms
[2024-06-01 13:57:28] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-01 13:57:28] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-06-01 13:57:28] [INFO ] Invariant cache hit.
[2024-06-01 13:57:29] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-01 13:57:29] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2024-06-01 13:57:29] [INFO ] Redundant transitions in 59 ms returned []
Running 595 sub problems to find dead transitions.
[2024-06-01 13:57:29] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
[2024-06-01 13:57:29] [INFO ] Invariant cache hit.
[2024-06-01 13:57:29] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 13:57:37] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 18 ms to minimize.
Problem TDEAD404 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 5 (OVERLAPS) 10/104 variables, 20/122 constraints. Problems are: Problem set: 1 solved, 594 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 10/132 constraints. Problems are: Problem set: 1 solved, 594 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 2/134 constraints. Problems are: Problem set: 192 solved, 403 unsolved
[2024-06-01 13:57:52] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 6 ms to minimize.
[2024-06-01 13:57:52] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 2 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 2 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 2 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 2 ms to minimize.
[2024-06-01 13:57:53] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 2 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 2 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 2 ms to minimize.
[2024-06-01 13:57:54] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 2 ms to minimize.
Problem TDEAD361 is UNSAT
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 2 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
[2024-06-01 13:57:55] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 2 ms to minimize.
Problem TDEAD392 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
[2024-06-01 13:57:56] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 2 ms to minimize.
Problem TDEAD360 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 14/148 constraints. Problems are: Problem set: 221 solved, 374 unsolved
[2024-06-01 13:57:59] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/149 constraints. Problems are: Problem set: 221 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/579 variables, and 149 constraints, problems are : Problem set: 221 solved, 374 unsolved in 30048 ms.
Refiners :[Domain max(s): 104/104 constraints, Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/104 constraints, ReadFeed: 0/210 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 221 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 5/99 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/101 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 11/112 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/112 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 10/104 variables, 20/132 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 10/142 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 2/144 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 5/149 constraints. Problems are: Problem set: 221 solved, 374 unsolved
[2024-06-01 13:58:07] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:58:09] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:58:09] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 3/152 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/152 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 11 (OVERLAPS) 475/579 variables, 104/256 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 210/466 constraints. Problems are: Problem set: 221 solved, 374 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 374/840 constraints. Problems are: Problem set: 221 solved, 374 unsolved
[2024-06-01 13:58:25] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/579 variables, and 841 constraints, problems are : Problem set: 221 solved, 374 unsolved in 30032 ms.
Refiners :[Domain max(s): 104/104 constraints, Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 374/595 constraints, Known Traps: 20/20 constraints]
After SMT, in 63335ms problems are : Problem set: 221 solved, 374 unsolved
Search for dead transitions found 221 dead transitions in 63388ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 104/104 places, 384/605 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Reduce places removed 0 places and 2 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Graph (complete) has 991 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 382
Reduce places removed 0 places and 2 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Graph (complete) has 981 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 380
Reduce places removed 0 places and 2 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Graph (complete) has 971 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 98 transition count 378
Reduce places removed 0 places and 2 transitions.
Computed a total of 2 stabilizing places and 0 stable transitions
Graph (complete) has 963 edges and 98 vertex of which 96 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 96 transition count 376
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 4 rules in 81 ms. Remains 96 /104 variables (removed 8) and now considering 376/384 (removed 8) transitions.
[2024-06-01 13:58:32] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
// Phase 1: matrix 299 rows 96 cols
[2024-06-01 13:58:32] [INFO ] Computed 29 invariants in 15 ms
[2024-06-01 13:58:33] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 13:58:33] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2024-06-01 13:58:33] [INFO ] Invariant cache hit.
[2024-06-01 13:58:33] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 13:58:33] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 96/104 places, 376/605 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 65142 ms. Remains : 96/104 places, 376/605 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4399 ms (no deadlock found). (steps per millisecond=284 )
Random directed walk for 1250001 steps, including 0 resets, run took 3472 ms (no deadlock found). (steps per millisecond=360 )
[2024-06-01 13:58:41] [INFO ] Flow matrix only has 299 transitions (discarded 77 similar events)
[2024-06-01 13:58:41] [INFO ] Invariant cache hit.
[2024-06-01 13:58:41] [INFO ] [Real]Absence check using 27 positive place invariants in 15 ms returned sat
[2024-06-01 13:58:41] [INFO ] [Real]Absence check using 27 positive and 2 generalized place invariants in 4 ms returned sat
[2024-06-01 13:58:41] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-06-01 13:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:58:41] [INFO ] [Nat]Absence check using 27 positive place invariants in 19 ms returned sat
[2024-06-01 13:58:41] [INFO ] [Nat]Absence check using 27 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 13:58:41] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-06-01 13:58:41] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 13:58:41] [INFO ] [Nat]Added 122 Read/Feed constraints in 44 ms returned sat
[2024-06-01 13:58:42] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:58:42] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:58:42] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-06-01 13:58:42] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:58:42] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:58:42] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2024-06-01 13:58:43] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:58:44] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 3 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:58:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 24 trap constraints in 3791 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 104/104 places, 605/605 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 603
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 34 place count 82 transition count 593
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 54 place count 72 transition count 583
Applied a total of 54 rules in 52 ms. Remains 72 /104 variables (removed 32) and now considering 583/605 (removed 22) transitions.
[2024-06-01 13:58:45] [INFO ] Flow matrix only has 453 transitions (discarded 130 similar events)
// Phase 1: matrix 453 rows 72 cols
[2024-06-01 13:58:45] [INFO ] Computed 19 invariants in 12 ms
[2024-06-01 13:58:46] [INFO ] Implicit Places using invariants in 376 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 379 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 70/104 places, 583/605 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 581
Applied a total of 4 rules in 17 ms. Remains 68 /70 variables (removed 2) and now considering 581/583 (removed 2) transitions.
[2024-06-01 13:58:46] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2024-06-01 13:58:46] [INFO ] Computed 17 invariants in 12 ms
[2024-06-01 13:58:46] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 13:58:46] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-06-01 13:58:46] [INFO ] Invariant cache hit.
[2024-06-01 13:58:46] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-01 13:58:47] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1355 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 68/104 places, 581/605 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1805 ms. Remains : 68/104 places, 581/605 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 3957 ms. (10 steps per ms) remains 231/571 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
[2024-06-01 13:58:48] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
[2024-06-01 13:58:48] [INFO ] Invariant cache hit.
[2024-06-01 13:58:48] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 16/62 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Problem qltransition_22 is UNSAT
SMT process timed out in 6114ms, After SMT, problems are : Problem set: 0 solved, 231 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 581/581 transitions.
Applied a total of 0 rules in 27 ms. Remains 68 /68 variables (removed 0) and now considering 581/581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 68/68 places, 581/581 transitions.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 87817 ms.
ITS solved all properties within timeout

BK_STOP 1717250335274

--------------------
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 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="SimpleLoadBal-PT-10"
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 SimpleLoadBal-PT-10, 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 r534-smll-171683819400104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-10.tgz
mv SimpleLoadBal-PT-10 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 ;