About the Execution of Marcie+red for AutoFlight-PT-03a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5517.004 | 12175.00 | 20102.00 | 38.50 | FFFTTFTFFFTFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813599000402.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutoFlight-PT-03a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000402
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 18:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 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 23K 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 AutoFlight-PT-03a-CTLFireability-00
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-01
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-02
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-03
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-04
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-05
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-06
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-07
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-08
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-09
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-10
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-11
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-12
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-13
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-14
FORMULA_NAME AutoFlight-PT-03a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678688035998
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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:13:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 06:13:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:13:58] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-13 06:13:58] [INFO ] Transformed 82 places.
[2023-03-13 06:13:58] [INFO ] Transformed 80 transitions.
[2023-03-13 06:13:58] [INFO ] Found NUPN structural information;
[2023-03-13 06:13:58] [INFO ] Parsed PT model containing 82 places and 80 transitions and 260 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Ensure Unique test removed 15 transitions
Reduce redundant transitions removed 15 transitions.
Support contains 68 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 65/65 transitions.
Applied a total of 0 rules in 12 ms. Remains 82 /82 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 82 cols
[2023-03-13 06:13:58] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-13 06:13:58] [INFO ] Implicit Places using invariants in 301 ms returned [27, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 333 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/82 places, 65/65 transitions.
Applied a total of 0 rules in 14 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 360 ms. Remains : 80/82 places, 65/65 transitions.
Support contains 68 out of 80 places after structural reductions.
[2023-03-13 06:13:59] [INFO ] Flatten gal took : 80 ms
[2023-03-13 06:13:59] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:13:59] [INFO ] Input system was already deterministic with 65 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 74) seen :58
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 65 rows 80 cols
[2023-03-13 06:13:59] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-13 06:14:00] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-13 06:14:00] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :8 sat :3 real:2
[2023-03-13 06:14:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-13 06:14:00] [INFO ] After 12ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :8 sat :0 real:5
[2023-03-13 06:14:00] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:5
[2023-03-13 06:14:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-13 06:14:00] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :5
[2023-03-13 06:14:00] [INFO ] After 22ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :8 sat :5
[2023-03-13 06:14:00] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 4 ms to minimize.
[2023-03-13 06:14:00] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2023-03-13 06:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 78 ms
[2023-03-13 06:14:00] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-13 06:14:00] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :4
Fused 13 Parikh solutions to 3 different solutions.
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 4 properties in 3 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA AutoFlight-PT-03a-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:14:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-03a-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Support contains 55 out of 80 places (down from 57) after GAL structural reductions.
Computed a total of 6 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 74 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 73 transition count 58
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 14 place count 73 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 24 place count 68 transition count 53
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 32 place count 64 transition count 49
Applied a total of 32 rules in 13 ms. Remains 64 /80 variables (removed 16) and now considering 49/65 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 64/80 places, 49/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 12 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 0 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 80/80 places, 65/65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:14:00] [INFO ] Input system was already deterministic with 65 transitions.
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:14:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:14:00] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 06:14:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 65 transitions and 224 arcs took 0 ms.
Total runtime 2382 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 80 NrTr: 65 NrArc: 224)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.860sec
RS generation: 0m 0.012sec
-> reachability set: #nodes 540 (5.4e+02) #states 157,681 (5)
starting MCC model checker
--------------------------
checking: AX [EG [[[1<=p71 & p71<=1] & [p78<=1 & 1<=p78]]]]
normalized: ~ [EX [~ [EG [[[p78<=1 & 1<=p78] & [1<=p71 & p71<=1]]]]]]
abstracting: (p71<=1)
states: 157,681 (5)
abstracting: (1<=p71)
states: 128,520 (5)
abstracting: (1<=p78)
states: 5,832 (3)
abstracting: (p78<=1)
states: 157,681 (5)
.................
EG iterations: 17
.-> the formula is FALSE
FORMULA AutoFlight-PT-03a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.064sec
checking: AG [EF [[AX [EF [[[p14<=0 & 0<=p14] | [p41<=0 & 0<=p41]]]] | [[p7<=1 & 1<=p7] & [p31<=1 & 1<=p31]]]]]
normalized: ~ [E [true U ~ [E [true U [~ [EX [~ [E [true U [[p41<=0 & 0<=p41] | [p14<=0 & 0<=p14]]]]]] | [[p31<=1 & 1<=p31] & [p7<=1 & 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 157,680 (5)
abstracting: (p7<=1)
states: 157,681 (5)
abstracting: (1<=p31)
states: 1,728 (3)
abstracting: (p31<=1)
states: 157,681 (5)
abstracting: (0<=p14)
states: 157,681 (5)
abstracting: (p14<=0)
states: 1
abstracting: (0<=p41)
states: 157,681 (5)
abstracting: (p41<=0)
states: 155,953 (5)
.-> the formula is TRUE
FORMULA AutoFlight-PT-03a-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AF [AG [[AG [E [[[p46<=1 & 1<=p46] & [p78<=1 & 1<=p78]] U [p13<=1 & 1<=p13]]] & [[p9<=1 & 1<=p9] & [p53<=1 & 1<=p53]]]]]
normalized: ~ [EG [E [true U ~ [[[[p53<=1 & 1<=p53] & [p9<=1 & 1<=p9]] & ~ [E [true U ~ [E [[[p78<=1 & 1<=p78] & [p46<=1 & 1<=p46]] U [p13<=1 & 1<=p13]]]]]]]]]]
abstracting: (1<=p13)
states: 55,872 (4)
abstracting: (p13<=1)
states: 157,681 (5)
abstracting: (1<=p46)
states: 122,904 (5)
abstracting: (p46<=1)
states: 157,681 (5)
abstracting: (1<=p78)
states: 5,832 (3)
abstracting: (p78<=1)
states: 157,681 (5)
abstracting: (1<=p9)
states: 44,208 (4)
abstracting: (p9<=1)
states: 157,681 (5)
abstracting: (1<=p53)
states: 1,728 (3)
abstracting: (p53<=1)
states: 157,681 (5)
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-03a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: [AX [[EG [[[p15<=1 & 1<=p15] & [p45<=1 & 1<=p45]]] | [[p53<=1 & 1<=p53] | [p37<=1 & 1<=p37]]]] | AG [EF [EG [[p26<=0 & 0<=p26]]]]]
normalized: [~ [E [true U ~ [E [true U EG [[p26<=0 & 0<=p26]]]]]] | ~ [EX [~ [[[[p37<=1 & 1<=p37] | [p53<=1 & 1<=p53]] | EG [[[p45<=1 & 1<=p45] & [p15<=1 & 1<=p15]]]]]]]]
abstracting: (1<=p15)
states: 57,384 (4)
abstracting: (p15<=1)
states: 157,681 (5)
abstracting: (1<=p45)
states: 5,832 (3)
abstracting: (p45<=1)
states: 157,681 (5)
...............
EG iterations: 15
abstracting: (1<=p53)
states: 1,728 (3)
abstracting: (p53<=1)
states: 157,681 (5)
abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 157,681 (5)
.abstracting: (0<=p26)
states: 157,681 (5)
abstracting: (p26<=0)
states: 78,841 (4)
.................
EG iterations: 17
-> the formula is TRUE
FORMULA AutoFlight-PT-03a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.069sec
checking: AX [[EX [0<=0] & EG [[[AG [[[p60<=0 & 0<=p60] | [p78<=0 & 0<=p78]]] | AG [[p19<=0 & 0<=p19]]] | [[p7<=0 & 0<=p7] | [p54<=0 & 0<=p54]]]]]]
normalized: ~ [EX [~ [[EG [[[[p54<=0 & 0<=p54] | [p7<=0 & 0<=p7]] | [~ [E [true U ~ [[p19<=0 & 0<=p19]]]] | ~ [E [true U ~ [[[p78<=0 & 0<=p78] | [p60<=0 & 0<=p60]]]]]]]] & EX [0<=0]]]]]
abstracting: (0<=0)
states: 157,681 (5)
.abstracting: (0<=p60)
states: 157,681 (5)
abstracting: (p60<=0)
states: 29,593 (4)
abstracting: (0<=p78)
states: 157,681 (5)
abstracting: (p78<=0)
states: 151,849 (5)
abstracting: (0<=p19)
states: 157,681 (5)
abstracting: (p19<=0)
states: 113,041 (5)
abstracting: (0<=p7)
states: 157,681 (5)
abstracting: (p7<=0)
states: 1
abstracting: (0<=p54)
states: 157,681 (5)
abstracting: (p54<=0)
states: 155,953 (5)
........................
EG iterations: 24
.-> the formula is TRUE
FORMULA AutoFlight-PT-03a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.131sec
checking: AF [[AF [AX [[[p21<=1 & 1<=p21] & [p33<=1 & 1<=p33]]]] & AF [[[[p3<=1 & 1<=p3] | [p51<=1 & 1<=p51]] & [[p7<=1 & 1<=p7] & [p31<=1 & 1<=p31]]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[[[p31<=1 & 1<=p31] & [p7<=1 & 1<=p7]] & [[p51<=1 & 1<=p51] | [p3<=1 & 1<=p3]]]]]] & ~ [EG [EX [~ [[[p33<=1 & 1<=p33] & [p21<=1 & 1<=p21]]]]]]]]]]
abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 157,681 (5)
....................
EG iterations: 19
abstracting: (1<=p3)
states: 56,304 (4)
abstracting: (p3<=1)
states: 157,681 (5)
abstracting: (1<=p51)
states: 1,728 (3)
abstracting: (p51<=1)
states: 157,681 (5)
abstracting: (1<=p7)
states: 157,680 (5)
abstracting: (p7<=1)
states: 157,681 (5)
abstracting: (1<=p31)
states: 1,728 (3)
abstracting: (p31<=1)
states: 157,681 (5)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-03a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.229sec
checking: A [[~ [[[EX [[p36<=1 & 1<=p36]] | AX [[p23<=1 & 1<=p23]]] & [p9<=1 & 1<=p9]]] & [AG [[[p71<=1 & 1<=p71] & [p78<=1 & 1<=p78]]] & [p19<=1 & 1<=p19]]] U EX [~ [EG [~ [A [[p28<=1 & 1<=p28] U [[p20<=1 & 1<=p20] & [p74<=1 & 1<=p74]]]]]]]]
normalized: [~ [EG [~ [EX [~ [EG [~ [[~ [EG [~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]] U [~ [[p28<=1 & 1<=p28]] & ~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]]]]]]]]]]]]] & ~ [E [~ [EX [~ [EG [~ [[~ [EG [~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]] U [~ [[p28<=1 & 1<=p28]] & ~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]]]]]]]]]]] U [~ [[[~ [E [true U ~ [[[p78<=1 & 1<=p78] & [p71<=1 & 1<=p71]]]]] & [p19<=1 & 1<=p19]] & ~ [[[p9<=1 & 1<=p9] & [~ [EX [~ [[p23<=1 & 1<=p23]]]] | EX [[p36<=1 & 1<=p36]]]]]]] & ~ [EX [~ [EG [~ [[~ [EG [~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]] U [~ [[p28<=1 & 1<=p28]] & ~ [[[p74<=1 & 1<=p74] & [p20<=1 & 1<=p20]]]]]]]]]]]]]]]]
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
abstracting: (1<=p28)
states: 78,840 (4)
abstracting: (p28<=1)
states: 157,681 (5)
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
...............
EG iterations: 15
...............
EG iterations: 15
.abstracting: (1<=p36)
states: 1,728 (3)
abstracting: (p36<=1)
states: 157,681 (5)
.abstracting: (1<=p23)
states: 78,840 (4)
abstracting: (p23<=1)
states: 157,681 (5)
.abstracting: (1<=p9)
states: 44,208 (4)
abstracting: (p9<=1)
states: 157,681 (5)
abstracting: (1<=p19)
states: 44,640 (4)
abstracting: (p19<=1)
states: 157,681 (5)
abstracting: (1<=p71)
states: 128,520 (5)
abstracting: (p71<=1)
states: 157,681 (5)
abstracting: (1<=p78)
states: 5,832 (3)
abstracting: (p78<=1)
states: 157,681 (5)
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
abstracting: (1<=p28)
states: 78,840 (4)
abstracting: (p28<=1)
states: 157,681 (5)
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
...............
EG iterations: 15
...............
EG iterations: 15
.abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
abstracting: (1<=p28)
states: 78,840 (4)
abstracting: (p28<=1)
states: 157,681 (5)
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p74)
states: 5,832 (3)
abstracting: (p74<=1)
states: 157,681 (5)
...............
EG iterations: 15
...............
EG iterations: 15
..
EG iterations: 1
-> the formula is FALSE
FORMULA AutoFlight-PT-03a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.067sec
checking: EG [[[EF [AG [[[p47<=0 & 0<=p47] | [p79<=0 & 0<=p79]]]] & AF [[p5<=1 & 1<=p5]]] & [[[p14<=0 & 0<=p14] | [p41<=0 & 0<=p41]] & [AX [[[0<=p63 & p63<=0] | [p6<=0 & 0<=p6]]] | [[p28<=1 & 1<=p28] & [[p14<=1 & 1<=p14] & [p55<=1 & 1<=p55]]]]]]]
normalized: EG [[[[[[[p55<=1 & 1<=p55] & [p14<=1 & 1<=p14]] & [p28<=1 & 1<=p28]] | ~ [EX [~ [[[p6<=0 & 0<=p6] | [0<=p63 & p63<=0]]]]]] & [[p41<=0 & 0<=p41] | [p14<=0 & 0<=p14]]] & [~ [EG [~ [[p5<=1 & 1<=p5]]]] & E [true U ~ [E [true U ~ [[[p79<=0 & 0<=p79] | [p47<=0 & 0<=p47]]]]]]]]]
abstracting: (0<=p47)
states: 157,681 (5)
abstracting: (p47<=0)
states: 155,953 (5)
abstracting: (0<=p79)
states: 157,681 (5)
abstracting: (p79<=0)
states: 5,833 (3)
abstracting: (1<=p5)
states: 46,800 (4)
abstracting: (p5<=1)
states: 157,681 (5)
.
EG iterations: 1
abstracting: (0<=p14)
states: 157,681 (5)
abstracting: (p14<=0)
states: 1
abstracting: (0<=p41)
states: 157,681 (5)
abstracting: (p41<=0)
states: 155,953 (5)
abstracting: (p63<=0)
states: 151,849 (5)
abstracting: (0<=p63)
states: 157,681 (5)
abstracting: (0<=p6)
states: 157,681 (5)
abstracting: (p6<=0)
states: 102,241 (5)
.abstracting: (1<=p28)
states: 78,840 (4)
abstracting: (p28<=1)
states: 157,681 (5)
abstracting: (1<=p14)
states: 157,680 (5)
abstracting: (p14<=1)
states: 157,681 (5)
abstracting: (1<=p55)
states: 1,728 (3)
abstracting: (p55<=1)
states: 157,681 (5)
............................
EG iterations: 28
-> the formula is FALSE
FORMULA AutoFlight-PT-03a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.147sec
checking: [AF [[p16<=1 & 1<=p16]] & [AF [EX [AG [[p52<=1 & 1<=p52]]]] | [E [[[p21<=1 & 1<=p21] & [p33<=1 & 1<=p33]] U [p23<=1 & 1<=p23]] | [EF [[[p14<=0 & 0<=p14] | [p55<=0 & 0<=p55]]] & AG [[EX [[[p29<=0 & 0<=p29] | [p76<=0 & 0<=p76]]] & ~ [E [[p6<=1 & 1<=p6] U [p37<=1 & 1<=p37]]]]]]]]]
normalized: [[~ [EG [~ [EX [~ [E [true U ~ [[p52<=1 & 1<=p52]]]]]]]] | [[E [true U [[p55<=0 & 0<=p55] | [p14<=0 & 0<=p14]]] & ~ [E [true U ~ [[~ [E [[p6<=1 & 1<=p6] U [p37<=1 & 1<=p37]]] & EX [[[p76<=0 & 0<=p76] | [p29<=0 & 0<=p29]]]]]]]] | E [[[p33<=1 & 1<=p33] & [p21<=1 & 1<=p21]] U [p23<=1 & 1<=p23]]]] & ~ [EG [~ [[p16<=1 & 1<=p16]]]]]
abstracting: (1<=p16)
states: 42,912 (4)
abstracting: (p16<=1)
states: 157,681 (5)
.
EG iterations: 1
abstracting: (1<=p23)
states: 78,840 (4)
abstracting: (p23<=1)
states: 157,681 (5)
abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 157,681 (5)
abstracting: (0<=p29)
states: 157,681 (5)
abstracting: (p29<=0)
states: 1
abstracting: (0<=p76)
states: 157,681 (5)
abstracting: (p76<=0)
states: 151,849 (5)
.abstracting: (1<=p37)
states: 1,728 (3)
abstracting: (p37<=1)
states: 157,681 (5)
abstracting: (1<=p6)
states: 55,440 (4)
abstracting: (p6<=1)
states: 157,681 (5)
abstracting: (0<=p14)
states: 157,681 (5)
abstracting: (p14<=0)
states: 1
abstracting: (0<=p55)
states: 157,681 (5)
abstracting: (p55<=0)
states: 155,953 (5)
abstracting: (1<=p52)
states: 1,728 (3)
abstracting: (p52<=1)
states: 157,681 (5)
.
EG iterations: 0
-> the formula is FALSE
FORMULA AutoFlight-PT-03a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: [A [~ [[[[p47<=1 & 1<=p47] & [p79<=1 & 1<=p79]] | AX [[[p17<=1 & 1<=p17] & [p73<=1 & 1<=p73]]]]] U [EF [~ [AG [[[p1<=1 & 1<=p1] & [p43<=1 & 1<=p43]]]]] & [p39<=1 & 1<=p39]]] | EG [[EX [[p20<=1 & 1<=p20]] & [[[p66<=0 & 0<=p66] | [p79<=0 & 0<=p79]] & [[p20<=0 & 0<=p20] | [p74<=0 & 0<=p74]]]]]]
normalized: [EG [[[[[p74<=0 & 0<=p74] | [p20<=0 & 0<=p20]] & [[p79<=0 & 0<=p79] | [p66<=0 & 0<=p66]]] & EX [[p20<=1 & 1<=p20]]]] | [~ [EG [~ [[[p39<=1 & 1<=p39] & E [true U E [true U ~ [[[p43<=1 & 1<=p43] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [E [~ [[[p39<=1 & 1<=p39] & E [true U E [true U ~ [[[p43<=1 & 1<=p43] & [p1<=1 & 1<=p1]]]]]]] U [[~ [EX [~ [[[p73<=1 & 1<=p73] & [p17<=1 & 1<=p17]]]]] | [[p79<=1 & 1<=p79] & [p47<=1 & 1<=p47]]] & ~ [[[p39<=1 & 1<=p39] & E [true U E [true U ~ [[[p43<=1 & 1<=p43] & [p1<=1 & 1<=p1]]]]]]]]]]]]
abstracting: (1<=p1)
states: 56,304 (4)
abstracting: (p1<=1)
states: 157,681 (5)
abstracting: (1<=p43)
states: 2,592 (3)
abstracting: (p43<=1)
states: 157,681 (5)
abstracting: (1<=p39)
states: 1,728 (3)
abstracting: (p39<=1)
states: 157,681 (5)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 157,681 (5)
abstracting: (1<=p79)
states: 151,848 (5)
abstracting: (p79<=1)
states: 157,681 (5)
abstracting: (1<=p17)
states: 57,384 (4)
abstracting: (p17<=1)
states: 157,681 (5)
abstracting: (1<=p73)
states: 5,832 (3)
abstracting: (p73<=1)
states: 157,681 (5)
.abstracting: (1<=p1)
states: 56,304 (4)
abstracting: (p1<=1)
states: 157,681 (5)
abstracting: (1<=p43)
states: 2,592 (3)
abstracting: (p43<=1)
states: 157,681 (5)
abstracting: (1<=p39)
states: 1,728 (3)
abstracting: (p39<=1)
states: 157,681 (5)
abstracting: (1<=p1)
states: 56,304 (4)
abstracting: (p1<=1)
states: 157,681 (5)
abstracting: (1<=p43)
states: 2,592 (3)
abstracting: (p43<=1)
states: 157,681 (5)
abstracting: (1<=p39)
states: 1,728 (3)
abstracting: (p39<=1)
states: 157,681 (5)
.........................
EG iterations: 25
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
.abstracting: (0<=p66)
states: 157,681 (5)
abstracting: (p66<=0)
states: 151,849 (5)
abstracting: (0<=p79)
states: 157,681 (5)
abstracting: (p79<=0)
states: 5,833 (3)
abstracting: (0<=p20)
states: 157,681 (5)
abstracting: (p20<=0)
states: 101,161 (5)
abstracting: (0<=p74)
states: 157,681 (5)
abstracting: (p74<=0)
states: 151,849 (5)
....................
EG iterations: 20
-> the formula is TRUE
FORMULA AutoFlight-PT-03a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.233sec
checking: AX [[E [E [[[p1<=1 & 1<=p1] & [p43<=1 & 1<=p43]] U AF [[p10<=1 & 1<=p10]]] U [A [EX [[[p14<=1 & 1<=p14] & [p49<=1 & 1<=p49]]] U ~ [[p28<=1 & 1<=p28]]] & EF [AG [[p0<=1 & 1<=p0]]]]] & E [~ [EX [E [[[p72<=1 & 1<=p72] & [p79<=1 & 1<=p79]] U [[p47<=1 & 1<=p47] & [p79<=1 & 1<=p79]]]]] U [p2<=1 & 1<=p2]]]]
normalized: ~ [EX [~ [[E [~ [EX [E [[[p79<=1 & 1<=p79] & [p72<=1 & 1<=p72]] U [[p79<=1 & 1<=p79] & [p47<=1 & 1<=p47]]]]] U [p2<=1 & 1<=p2]] & E [E [[[p43<=1 & 1<=p43] & [p1<=1 & 1<=p1]] U ~ [EG [~ [[p10<=1 & 1<=p10]]]]] U [E [true U ~ [E [true U ~ [[p0<=1 & 1<=p0]]]]] & [~ [EG [[p28<=1 & 1<=p28]]] & ~ [E [[p28<=1 & 1<=p28] U [~ [EX [[[p49<=1 & 1<=p49] & [p14<=1 & 1<=p14]]]] & [p28<=1 & 1<=p28]]]]]]]]]]]
abstracting: (1<=p28)
states: 78,840 (4)
abstracting: (p28<=1)
states: 157,681 (5)
abstracting: (1<=p14)
states: 157,680 (5)
abstracting: (p14<=1)
states: 157,681 (5)
abstracting: (1<=p49)
states: 1,728 (3)
abstracting: (p49<=1)
states: 157,681 (5)
.abstracting: (1<=p28)
states: 78,840 (4)
abstracting: (p28<=1)
states: 157,681 (5)
abstracting: (1<=p28)
states: 78,840 (4)
abstracting: (p28<=1)
states: 157,681 (5)
...................
EG iterations: 19
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 157,681 (5)
abstracting: (1<=p10)
states: 56,736 (4)
abstracting: (p10<=1)
states: 157,681 (5)
....................
EG iterations: 20
abstracting: (1<=p1)
states: 56,304 (4)
abstracting: (p1<=1)
states: 157,681 (5)
abstracting: (1<=p43)
states: 2,592 (3)
abstracting: (p43<=1)
states: 157,681 (5)
abstracting: (1<=p2)
states: 45,072 (4)
abstracting: (p2<=1)
states: 157,681 (5)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 157,681 (5)
abstracting: (1<=p79)
states: 151,848 (5)
abstracting: (p79<=1)
states: 157,681 (5)
abstracting: (1<=p72)
states: 5,832 (3)
abstracting: (p72<=1)
states: 157,681 (5)
abstracting: (1<=p79)
states: 151,848 (5)
abstracting: (p79<=1)
states: 157,681 (5)
..-> the formula is FALSE
FORMULA AutoFlight-PT-03a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.342sec
checking: AX [[AG [AX [[EF [[p51<=1 & 1<=p51]] & [[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]]]]] | [EF [[AG [[[p21<=1 & 1<=p21] & [p50<=1 & 1<=p50]]] | [[p20<=1 & 1<=p20] | [[p47<=1 & 1<=p47] & [p79<=1 & 1<=p79]]]]] & [EG [A [EF [[[p22<=1 & 1<=p22] & [p64<=1 & 1<=p64]]] U [p2<=1 & 1<=p2]]] & [EF [[[p7<=1 & 1<=p7] & [p31<=1 & 1<=p31]]] | [[p16<=1 & 1<=p16] | AF [[[p21<=1 & 1<=p21] & [p33<=1 & 1<=p33]]]]]]]]]
normalized: ~ [EX [~ [[[[[[~ [EG [~ [[[p33<=1 & 1<=p33] & [p21<=1 & 1<=p21]]]]] | [p16<=1 & 1<=p16]] | E [true U [[p31<=1 & 1<=p31] & [p7<=1 & 1<=p7]]]] & EG [[~ [EG [~ [[p2<=1 & 1<=p2]]]] & ~ [E [~ [[p2<=1 & 1<=p2]] U [~ [E [true U [[p64<=1 & 1<=p64] & [p22<=1 & 1<=p22]]]] & ~ [[p2<=1 & 1<=p2]]]]]]]] & E [true U [[[[p79<=1 & 1<=p79] & [p47<=1 & 1<=p47]] | [p20<=1 & 1<=p20]] | ~ [E [true U ~ [[[p50<=1 & 1<=p50] & [p21<=1 & 1<=p21]]]]]]]] | ~ [E [true U EX [~ [[[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]] & E [true U [p51<=1 & 1<=p51]]]]]]]]]]]
abstracting: (1<=p51)
states: 1,728 (3)
abstracting: (p51<=1)
states: 157,681 (5)
abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p42)
states: 1,728 (3)
abstracting: (p42<=1)
states: 157,681 (5)
.abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p50)
states: 1,728 (3)
abstracting: (p50<=1)
states: 157,681 (5)
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 157,681 (5)
abstracting: (1<=p79)
states: 151,848 (5)
abstracting: (p79<=1)
states: 157,681 (5)
abstracting: (1<=p2)
states: 45,072 (4)
abstracting: (p2<=1)
states: 157,681 (5)
abstracting: (1<=p22)
states: 78,840 (4)
abstracting: (p22<=1)
states: 157,681 (5)
abstracting: (1<=p64)
states: 5,832 (3)
abstracting: (p64<=1)
states: 157,681 (5)
abstracting: (1<=p2)
states: 45,072 (4)
abstracting: (p2<=1)
states: 157,681 (5)
abstracting: (1<=p2)
states: 45,072 (4)
abstracting: (p2<=1)
states: 157,681 (5)
.
EG iterations: 1
....................
EG iterations: 20
abstracting: (1<=p7)
states: 157,680 (5)
abstracting: (p7<=1)
states: 157,681 (5)
abstracting: (1<=p31)
states: 1,728 (3)
abstracting: (p31<=1)
states: 157,681 (5)
abstracting: (1<=p16)
states: 42,912 (4)
abstracting: (p16<=1)
states: 157,681 (5)
abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 157,681 (5)
...............................
EG iterations: 31
.-> the formula is FALSE
FORMULA AutoFlight-PT-03a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.164sec
checking: EG [[[EF [[[p61<=1 & 1<=p61] & [p79<=1 & 1<=p79]]] | [AX [[[p46<=0 & 0<=p46] | [p78<=0 & 0<=p78]]] | AX [[[p71<=1 & 1<=p71] & [p78<=1 & 1<=p78]]]]] | [[p52<=1 & 1<=p52] | [[~ [E [EX [[[p21<=1 & 1<=p21] & [p33<=1 & 1<=p33]]] U [p35<=1 & 1<=p35]]] & [[p26<=0 & 0<=p26] & [E [[p28<=1 & 1<=p28] U [[p14<=1 & 1<=p14] & [p41<=1 & 1<=p41]]] | [p52<=0 & 0<=p52]]]] | [[p72<=1 & 1<=p72] & [p79<=1 & 1<=p79]]]]]]
normalized: EG [[[[[[p79<=1 & 1<=p79] & [p72<=1 & 1<=p72]] | [[[[p52<=0 & 0<=p52] | E [[p28<=1 & 1<=p28] U [[p41<=1 & 1<=p41] & [p14<=1 & 1<=p14]]]] & [p26<=0 & 0<=p26]] & ~ [E [EX [[[p33<=1 & 1<=p33] & [p21<=1 & 1<=p21]]] U [p35<=1 & 1<=p35]]]]] | [p52<=1 & 1<=p52]] | [[~ [EX [~ [[[p78<=1 & 1<=p78] & [p71<=1 & 1<=p71]]]]] | ~ [EX [~ [[[p78<=0 & 0<=p78] | [p46<=0 & 0<=p46]]]]]] | E [true U [[p79<=1 & 1<=p79] & [p61<=1 & 1<=p61]]]]]]
abstracting: (1<=p61)
states: 5,832 (3)
abstracting: (p61<=1)
states: 157,681 (5)
abstracting: (1<=p79)
states: 151,848 (5)
abstracting: (p79<=1)
states: 157,681 (5)
abstracting: (0<=p46)
states: 157,681 (5)
abstracting: (p46<=0)
states: 34,777 (4)
abstracting: (0<=p78)
states: 157,681 (5)
abstracting: (p78<=0)
states: 151,849 (5)
.abstracting: (1<=p71)
states: 128,520 (5)
abstracting: (p71<=1)
states: 157,681 (5)
abstracting: (1<=p78)
states: 5,832 (3)
abstracting: (p78<=1)
states: 157,681 (5)
.abstracting: (1<=p52)
states: 1,728 (3)
abstracting: (p52<=1)
states: 157,681 (5)
abstracting: (1<=p35)
states: 1,728 (3)
abstracting: (p35<=1)
states: 157,681 (5)
abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 157,681 (5)
.abstracting: (0<=p26)
states: 157,681 (5)
abstracting: (p26<=0)
states: 78,841 (4)
abstracting: (1<=p14)
states: 157,680 (5)
abstracting: (p14<=1)
states: 157,681 (5)
abstracting: (1<=p41)
states: 1,728 (3)
abstracting: (p41<=1)
states: 157,681 (5)
abstracting: (1<=p28)
states: 78,840 (4)
abstracting: (p28<=1)
states: 157,681 (5)
abstracting: (0<=p52)
states: 157,681 (5)
abstracting: (p52<=0)
states: 155,953 (5)
abstracting: (1<=p72)
states: 5,832 (3)
abstracting: (p72<=1)
states: 157,681 (5)
abstracting: (1<=p79)
states: 151,848 (5)
abstracting: (p79<=1)
states: 157,681 (5)
EG iterations: 0
-> the formula is TRUE
FORMULA AutoFlight-PT-03a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.052sec
checking: [E [[[p34<=1 & 1<=p34] & [AX [[p6<=1 & 1<=p6]] | [[p71<=1 & 1<=p71] & [p78<=1 & 1<=p78]]]] U [p35<=1 & 1<=p35]] | [EX [E [~ [[AG [[p20<=1 & 1<=p20]] & E [[p34<=1 & 1<=p34] U [p6<=1 & 1<=p6]]]] U AF [[[p26<=1 & 1<=p26] & [[p21<=1 & 1<=p21] & [p33<=1 & 1<=p33]]]]]] & [AX [[p2<=0 & 0<=p2]] | [AX [[[[p61<=1 & 1<=p61] & [p79<=1 & 1<=p79]] | [[p21<=1 & 1<=p21] & [p50<=1 & 1<=p50]]]] | ~ [E [~ [[A [[[p3<=1 & 1<=p3] & [p62<=1 & 1<=p62]] U [p0<=1 & 1<=p0]] | [[[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]] | [p3<=1 & 1<=p3]]]] U EX [[[[p47<=1 & 1<=p47] & [p79<=1 & 1<=p79]] | [[p29<=1 & 1<=p29] & [p76<=1 & 1<=p76]]]]]]]]]]
normalized: [[[[~ [E [~ [[[[p3<=1 & 1<=p3] | [[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]]] | [~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[[p62<=1 & 1<=p62] & [p3<=1 & 1<=p3]]] & ~ [[p0<=1 & 1<=p0]]]]]]]] U EX [[[[p76<=1 & 1<=p76] & [p29<=1 & 1<=p29]] | [[p79<=1 & 1<=p79] & [p47<=1 & 1<=p47]]]]]] | ~ [EX [~ [[[[p50<=1 & 1<=p50] & [p21<=1 & 1<=p21]] | [[p79<=1 & 1<=p79] & [p61<=1 & 1<=p61]]]]]]] | ~ [EX [~ [[p2<=0 & 0<=p2]]]]] & EX [E [~ [[E [[p34<=1 & 1<=p34] U [p6<=1 & 1<=p6]] & ~ [E [true U ~ [[p20<=1 & 1<=p20]]]]]] U ~ [EG [~ [[[[p33<=1 & 1<=p33] & [p21<=1 & 1<=p21]] & [p26<=1 & 1<=p26]]]]]]]] | E [[[[[p78<=1 & 1<=p78] & [p71<=1 & 1<=p71]] | ~ [EX [~ [[p6<=1 & 1<=p6]]]]] & [p34<=1 & 1<=p34]] U [p35<=1 & 1<=p35]]]
abstracting: (1<=p35)
states: 1,728 (3)
abstracting: (p35<=1)
states: 157,681 (5)
abstracting: (1<=p34)
states: 1,728 (3)
abstracting: (p34<=1)
states: 157,681 (5)
abstracting: (1<=p6)
states: 55,440 (4)
abstracting: (p6<=1)
states: 157,681 (5)
.abstracting: (1<=p71)
states: 128,520 (5)
abstracting: (p71<=1)
states: 157,681 (5)
abstracting: (1<=p78)
states: 5,832 (3)
abstracting: (p78<=1)
states: 157,681 (5)
abstracting: (1<=p26)
states: 78,840 (4)
abstracting: (p26<=1)
states: 157,681 (5)
abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p33)
states: 1,728 (3)
abstracting: (p33<=1)
states: 157,681 (5)
.
EG iterations: 1
abstracting: (1<=p20)
states: 56,520 (4)
abstracting: (p20<=1)
states: 157,681 (5)
abstracting: (1<=p6)
states: 55,440 (4)
abstracting: (p6<=1)
states: 157,681 (5)
abstracting: (1<=p34)
states: 1,728 (3)
abstracting: (p34<=1)
states: 157,681 (5)
.abstracting: (0<=p2)
states: 157,681 (5)
abstracting: (p2<=0)
states: 112,609 (5)
.abstracting: (1<=p61)
states: 5,832 (3)
abstracting: (p61<=1)
states: 157,681 (5)
abstracting: (1<=p79)
states: 151,848 (5)
abstracting: (p79<=1)
states: 157,681 (5)
abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p50)
states: 1,728 (3)
abstracting: (p50<=1)
states: 157,681 (5)
.abstracting: (1<=p47)
states: 1,728 (3)
abstracting: (p47<=1)
states: 157,681 (5)
abstracting: (1<=p79)
states: 151,848 (5)
abstracting: (p79<=1)
states: 157,681 (5)
abstracting: (1<=p29)
states: 157,680 (5)
abstracting: (p29<=1)
states: 157,681 (5)
abstracting: (1<=p76)
states: 5,832 (3)
abstracting: (p76<=1)
states: 157,681 (5)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 157,681 (5)
abstracting: (1<=p3)
states: 56,304 (4)
abstracting: (p3<=1)
states: 157,681 (5)
abstracting: (1<=p62)
states: 5,832 (3)
abstracting: (p62<=1)
states: 157,681 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 157,681 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 157,681 (5)
.
EG iterations: 1
abstracting: (1<=p21)
states: 157,680 (5)
abstracting: (p21<=1)
states: 157,681 (5)
abstracting: (1<=p42)
states: 1,728 (3)
abstracting: (p42<=1)
states: 157,681 (5)
abstracting: (1<=p3)
states: 56,304 (4)
abstracting: (p3<=1)
states: 157,681 (5)
-> the formula is TRUE
FORMULA AutoFlight-PT-03a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.091sec
totally nodes used: 1134541 (1.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1354289 2810703 4164992
used/not used/entry size/cache size: 4018471 63090393 16 1024MB
basic ops cache: hits/miss/sum: 198857 521214 720071
used/not used/entry size/cache size: 961780 15815436 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 3232 7751 10983
used/not used/entry size/cache size: 7750 8380858 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66020139
1 1046501
2 38867
3 3135
4 209
5 13
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 7.186sec
BK_STOP 1678688048173
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:1065 (16), effective:159 (2)
initing FirstDep: 0m 0.000sec
iterations count:67 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:67 (1), effective:1 (0)
iterations count:190 (2), effective:21 (0)
iterations count:65 (1), effective:0 (0)
iterations count:123 (1), effective:5 (0)
iterations count:558 (8), effective:66 (1)
iterations count:971 (14), effective:123 (1)
iterations count:66 (1), effective:1 (0)
iterations count:73 (1), effective:1 (0)
iterations count:66 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:66 (1), effective:1 (0)
iterations count:563 (8), effective:66 (1)
iterations count:483 (7), effective:60 (0)
iterations count:65 (1), effective:0 (0)
iterations count:425 (6), effective:51 (0)
iterations count:507 (7), effective:75 (1)
iterations count:67 (1), effective:1 (0)
iterations count:68 (1), effective:1 (0)
iterations count:74 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:74 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:385 (5), effective:56 (0)
iterations count:74 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:84 (1), effective:2 (0)
iterations count:117 (1), effective:1 (0)
iterations count:65 (1), effective:0 (0)
iterations count:65 (1), effective:0 (0)
iterations count:630 (9), effective:77 (1)
iterations count:566 (8), effective:66 (1)
iterations count:74 (1), effective:1 (0)
iterations count:77 (1), effective:1 (0)
iterations count:536 (8), effective:60 (0)
iterations count:564 (8), effective:66 (1)
iterations count:462 (7), effective:59 (0)
iterations count:535 (8), effective:66 (1)
iterations count:1136 (17), effective:148 (2)
iterations count:65 (1), effective:0 (0)
iterations count:508 (7), effective:62 (0)
iterations count:65 (1), effective:0 (0)
iterations count:130 (2), effective:13 (0)
iterations count:67 (1), effective:1 (0)
iterations count:1430 (22), effective:194 (2)
iterations count:88 (1), effective:1 (0)
iterations count:351 (5), effective:46 (0)
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="AutoFlight-PT-03a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is AutoFlight-PT-03a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599000402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03a.tgz
mv AutoFlight-PT-03a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;