Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690700708.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANInsertWithFailure-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690700708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.9K Feb 26 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 00:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 698K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678374096717

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 15:01:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 15:01:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:01:39] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-09 15:01:39] [INFO ] Transformed 324 places.
[2023-03-09 15:01:39] [INFO ] Transformed 660 transitions.
[2023-03-09 15:01:39] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 54 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-09 15:01:39] [INFO ] Computed 12 place invariants in 26 ms
[2023-03-09 15:01:39] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-09 15:01:39] [INFO ] Invariant cache hit.
[2023-03-09 15:01:39] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:40] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2023-03-09 15:01:40] [INFO ] Invariant cache hit.
[2023-03-09 15:01:40] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1599 ms. Remains : 323/324 places, 660/660 transitions.
Support contains 37 out of 323 places after structural reductions.
[2023-03-09 15:01:41] [INFO ] Flatten gal took : 113 ms
[2023-03-09 15:01:41] [INFO ] Flatten gal took : 46 ms
[2023-03-09 15:01:41] [INFO ] Input system was already deterministic with 660 transitions.
Support contains 33 out of 323 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:01:41] [INFO ] Invariant cache hit.
[2023-03-09 15:01:41] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 15:01:41] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:01:42] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 42 stabilizing places and 70 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 318 place count 164 transition count 501
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 389 place count 164 transition count 430
Applied a total of 389 rules in 140 ms. Remains 164 /323 variables (removed 159) and now considering 430/660 (removed 230) transitions.
// Phase 1: matrix 430 rows 164 cols
[2023-03-09 15:01:42] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-09 15:01:42] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-09 15:01:43] [INFO ] Invariant cache hit.
[2023-03-09 15:01:43] [INFO ] State equation strengthened by 287 read => feed constraints.
[2023-03-09 15:01:43] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-09 15:01:43] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-09 15:01:43] [INFO ] Invariant cache hit.
[2023-03-09 15:01:43] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/323 places, 430/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1143 ms. Remains : 164/323 places, 430/660 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s75 1) (AND (GEQ s1 1) (GEQ s162 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-00 finished in 1497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 323 transition count 592
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 136 place count 255 transition count 591
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 312 place count 167 transition count 504
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 2 with 70 rules applied. Total rules applied 382 place count 167 transition count 434
Applied a total of 382 rules in 98 ms. Remains 167 /323 variables (removed 156) and now considering 434/660 (removed 226) transitions.
// Phase 1: matrix 434 rows 167 cols
[2023-03-09 15:01:44] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-09 15:01:44] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 15:01:44] [INFO ] Invariant cache hit.
[2023-03-09 15:01:44] [INFO ] State equation strengthened by 285 read => feed constraints.
[2023-03-09 15:01:44] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-09 15:01:44] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-09 15:01:44] [INFO ] Invariant cache hit.
[2023-03-09 15:01:45] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/323 places, 434/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 900 ms. Remains : 167/323 places, 434/660 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s78 1) (LT s104 1)), p1:(AND (GEQ s29 1) (GEQ s61 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1757 reset in 399 ms.
Stack based approach found an accepted trace after 927 steps with 17 reset with depth 37 and stack size 37 in 4 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-01 finished in 1403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(p1)))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-09 15:01:45] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-09 15:01:45] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-09 15:01:45] [INFO ] Invariant cache hit.
[2023-03-09 15:01:45] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:46] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2023-03-09 15:01:46] [INFO ] Invariant cache hit.
[2023-03-09 15:01:46] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p1:(AND (LT s226 1) (GEQ s182 1)), p0:(GEQ s182 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-04 finished in 1413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((p0||G(p1))) U (p2&&X(F(p1)))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:46] [INFO ] Invariant cache hit.
[2023-03-09 15:01:47] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-09 15:01:47] [INFO ] Invariant cache hit.
[2023-03-09 15:01:47] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:47] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-09 15:01:47] [INFO ] Invariant cache hit.
[2023-03-09 15:01:48] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1145 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 4}, { cond=p2, acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s154 1), p0:(LT s100 1), p1:(LT s273 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 315 steps with 1 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-05 finished in 1608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(p1 U p2)))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:48] [INFO ] Invariant cache hit.
[2023-03-09 15:01:48] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-09 15:01:48] [INFO ] Invariant cache hit.
[2023-03-09 15:01:49] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:49] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2023-03-09 15:01:49] [INFO ] Invariant cache hit.
[2023-03-09 15:01:49] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1149 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s7 1) (GEQ s161 1)), p1:(GEQ s278 1), p0:(LT s120 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-10 finished in 1419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U G((F(G(p0)) U p1))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 316 place count 165 transition count 502
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 2 with 71 rules applied. Total rules applied 387 place count 165 transition count 431
Applied a total of 387 rules in 43 ms. Remains 165 /323 variables (removed 158) and now considering 431/660 (removed 229) transitions.
// Phase 1: matrix 431 rows 165 cols
[2023-03-09 15:01:50] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-09 15:01:50] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-09 15:01:50] [INFO ] Invariant cache hit.
[2023-03-09 15:01:50] [INFO ] State equation strengthened by 287 read => feed constraints.
[2023-03-09 15:01:50] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-09 15:01:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 15:01:50] [INFO ] Invariant cache hit.
[2023-03-09 15:01:50] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/323 places, 431/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 921 ms. Remains : 165/323 places, 431/660 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s136 1), p0:(AND (GEQ s47 1) (GEQ s80 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-11 finished in 1126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 323 transition count 601
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 264 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 263 transition count 600
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 298 place count 174 transition count 511
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 3 with 71 rules applied. Total rules applied 369 place count 174 transition count 440
Applied a total of 369 rules in 43 ms. Remains 174 /323 variables (removed 149) and now considering 440/660 (removed 220) transitions.
// Phase 1: matrix 440 rows 174 cols
[2023-03-09 15:01:51] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-09 15:01:51] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-09 15:01:51] [INFO ] Invariant cache hit.
[2023-03-09 15:01:51] [INFO ] State equation strengthened by 287 read => feed constraints.
[2023-03-09 15:01:51] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-09 15:01:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 15:01:51] [INFO ] Invariant cache hit.
[2023-03-09 15:01:52] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/323 places, 440/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 930 ms. Remains : 174/323 places, 440/660 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s154 1), p1:(OR (AND (GEQ s0 1) (GEQ s38 1)) (GEQ s154 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 56 steps with 1 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-12 finished in 1146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1)&&G(p2))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-09 15:01:52] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-09 15:01:52] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-09 15:01:52] [INFO ] Invariant cache hit.
[2023-03-09 15:01:52] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:53] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-03-09 15:01:53] [INFO ] Invariant cache hit.
[2023-03-09 15:01:53] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s262 1), p2:(GEQ s184 1), p1:(LT s308 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 255 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-13 finished in 1229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1))||X(F(!p1))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:53] [INFO ] Invariant cache hit.
[2023-03-09 15:01:53] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-09 15:01:53] [INFO ] Invariant cache hit.
[2023-03-09 15:01:53] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:54] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-03-09 15:01:54] [INFO ] Invariant cache hit.
[2023-03-09 15:01:54] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 807 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 75 ms :[false, (AND p1 (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s154 1), p0:(GEQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Detected a total of 42/323 stabilizing places and 70/660 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLFireability-15 finished in 1747 ms.
All properties solved by simple procedures.
Total runtime 16380 ms.

BK_STOP 1678374115646

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690700708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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