About the Execution of ITS-LoLa for DiscoveryGPU-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.950 | 3600000.00 | 19652.00 | 58.40 | TTTFTTFFTFFFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882600585.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DiscoveryGPU-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882600585
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K Mar 31 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 23:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 23:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 22K Mar 24 05:37 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 DiscoveryGPU-PT-06a-00
FORMULA_NAME DiscoveryGPU-PT-06a-01
FORMULA_NAME DiscoveryGPU-PT-06a-02
FORMULA_NAME DiscoveryGPU-PT-06a-03
FORMULA_NAME DiscoveryGPU-PT-06a-04
FORMULA_NAME DiscoveryGPU-PT-06a-05
FORMULA_NAME DiscoveryGPU-PT-06a-06
FORMULA_NAME DiscoveryGPU-PT-06a-07
FORMULA_NAME DiscoveryGPU-PT-06a-08
FORMULA_NAME DiscoveryGPU-PT-06a-09
FORMULA_NAME DiscoveryGPU-PT-06a-10
FORMULA_NAME DiscoveryGPU-PT-06a-11
FORMULA_NAME DiscoveryGPU-PT-06a-12
FORMULA_NAME DiscoveryGPU-PT-06a-13
FORMULA_NAME DiscoveryGPU-PT-06a-14
FORMULA_NAME DiscoveryGPU-PT-06a-15
=== Now, execution of the tool begins
BK_START 1591229661806
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:14:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 00:14:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:14:23] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2020-06-04 00:14:23] [INFO ] Transformed 63 places.
[2020-06-04 00:14:23] [INFO ] Transformed 85 transitions.
[2020-06-04 00:14:23] [INFO ] Found NUPN structural information;
[2020-06-04 00:14:23] [INFO ] Parsed PT model containing 63 places and 85 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1532 resets, run finished after 166 ms. (steps per millisecond=602 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-04 00:14:23] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
// Phase 1: matrix 79 rows 63 cols
[2020-06-04 00:14:23] [INFO ] Computed 2 place invariants in 3 ms
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 00:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-06-04 00:14:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned unsat
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-04 00:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-04 00:14:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-06-04 00:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-04 00:14:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-06-04 00:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-04 00:14:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned unsat
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-06-04 00:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-04 00:14:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-06-04 00:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-04 00:14:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned unsat
[2020-06-04 00:14:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-06-04 00:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-04 00:14:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-06-04 00:14:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-06-04 00:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-04 00:14:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-06-04 00:14:24] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-04 00:14:24] [INFO ] Flatten gal took : 43 ms
FORMULA DiscoveryGPU-PT-06a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:14:24] [INFO ] Applying decomposition
[2020-06-04 00:14:24] [INFO ] Flatten gal took : 7 ms
[2020-06-04 00:14:24] [INFO ] Decomposing Gal with order
[2020-06-04 00:14:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 00:14:24] [INFO ] Removed a total of 52 redundant transitions.
[2020-06-04 00:14:24] [INFO ] Flatten gal took : 30 ms
[2020-06-04 00:14:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2020-06-04 00:14:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 00:14:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DiscoveryGPU-PT-06a @ 3570 seconds
FORMULA DiscoveryGPU-PT-06a-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-06a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-06a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-06a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-06a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-06a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-06a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3558
rslt: Output for LTLCardinality @ DiscoveryGPU-PT-06a
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 00:14:24 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 1,
"U": 0,
"X": 2,
"aconj": 10,
"adisj": 4,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((F ((((p41 <= 0)) OR ((1 <= p25)))) OR ((p25 <= 0)))) OR (X (F ((F ((((1 <= p50)) AND ((p52 <= 0)))) OR (((1 <= p50)) AND ((p52 <= 0)))))) AND (F ((((p41 <= 0)) OR ((1 <= p25)))) OR ((p25 <= 0)))))))",
"processed_size": 211,
"rewrites": 46
},
"result":
{
"edges": 12342371,
"markings": 1610517,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((1 <= p44)) AND ((p42 <= 0))) R X (G ((((p3 <= 0)) OR ((1 <= p24)))))))",
"processed_size": 78,
"rewrites": 46
},
"result":
{
"edges": 3939,
"markings": 1037,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p7))",
"processed_size": 11,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p17)) AND ((p12 <= 0)))))",
"processed_size": 39,
"rewrites": 46
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((((p39 <= 0)) OR ((1 <= p53))))))",
"processed_size": 43,
"rewrites": 46
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 5,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((F ((((1 <= p1)) AND ((p19 <= 0)))) AND (F ((((p1 <= 0)) OR ((1 <= p7)))) OR (((1 <= p1)) AND ((p19 <= 0)))))) AND X (((p12 <= 0)))))",
"processed_size": 141,
"rewrites": 46
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((((1 <= p3)) OR ((p1 <= 0)) OR ((1 <= p25)))) AND (X (X ((((p1 <= 0)) OR ((1 <= p25))))) OR F (((1 <= p25))))))",
"processed_size": 121,
"rewrites": 46
},
"result":
{
"edges": 3982,
"markings": 1065,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3558
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 13,
"adisj": 6,
"aneg": 4,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F ((((((1 <= p24)) AND ((p33 <= 0))) R (((1 <= p1)) AND ((p33 <= 0)))) OR (((p39 <= 0)) OR ((1 <= p42))))) AND ((((1 <= p24)) AND ((p33 <= 0))) OR (((((1 <= p24)) AND ((p33 <= 0))) R (((1 <= p1)) AND ((p33 <= 0)))) OR (((p39 <= 0)) OR ((1 <= p42)))))))",
"processed_size": 256,
"rewrites": 46
},
"result":
{
"edges": 51,
"markings": 48,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 28116,
"runtime": 12.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((G((F(**) OR *)) OR (X(F((F(*) OR *))) AND (F(**) OR *))))) : G((F(((* R *) OR (** OR **))) AND (** OR ((* R *) OR (** OR **))))) : X((* R X(G(**)))) : (X(F(*)) AND F(*)) : X(X(G(**))) : F((G((F(**) AND (F(**) OR **))) AND X(*))) : X((G(**) AND (X(X(**)) OR F(**))))"
},
"net":
{
"arcs": 273,
"conflict_clusters": 9,
"places": 63,
"places_significant": 61,
"singleton_clusters": 0,
"transitions": 85
},
"result":
{
"preliminary_value": "yes no no no no no no ",
"value": "yes no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 148/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 63
lola: finding significant places
lola: 63 places, 85 transitions, 61 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: NOT(G (X ((X (G ((G ((((p50 <= 0)) OR ((1 <= p52)))) AND (((p50 <= 0)) OR ((1 <= p52)))))) U (NOT(F ((((p41 <= 0)) OR ((1 <= p25))))) AND ((1 <= p25))))))) : G (((((1 <= p24)) AND ((p33 <= 0))) U ((NOT(((((p24 <= 0)) OR ((1 <= p33))) U (((p1 <= 0)) OR ((1 <= p33))))) OR ((p39 <= 0))) OR ((1 <= p42))))) : X (NOT(((((p44 <= 0)) OR ((1 <= p42))) U X (NOT(G ((((p3 <= 0)) OR ((1 <= p24))))))))) : (NOT(X (G ((((p17 <= 0)) OR ((1 <= p12)))))) AND NOT(G (((1 <= p7))))) : X (X (G ((((p39 <= 0)) OR ((1 <= p53)))))) : F ((G ((F ((((p1 <= 0)) OR ((1 <= p7)))) U (((1 <= p1)) AND ((p19 <= 0))))) AND NOT(X (((1 <= p12)))))) : X ((G ((((1 <= p3)) OR ((p1 <= 0)) OR ((1 <= p25)))) AND (X (X ((((p1 <= 0)) OR ((1 <= p25))))) OR F (((1 <= p25))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((F ((((p41 <= 0)) OR ((1 <= p25)))) OR ((p25 <= 0)))) OR (X (F ((F ((((1 <= p50)) AND ((p52 <= 0)))) OR (((1 <= p50)) AND ((p52 <= 0)))))) AND (F ((((p41 <= 0)) OR ((1 <= p25)))) OR ((p25 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((F ((((p41 <= 0)) OR ((1 <= p25)))) OR ((p25 <= 0)))) OR (X (F ((F ((((1 <= p50)) AND ((p52 <= 0)))) OR (((1 <= p50)) AND ((p52 <= 0)))))) AND (F ((((p41 <= 0)) OR ((1 <= p25)))) OR ((p25 <= 0)))))))
lola: processed formula length: 211
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 938564 markings, 7304761 edges, 187713 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1610517 markings, 12342371 edges
lola: ========================================
lola: subprocess 1 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p44)) AND ((p42 <= 0))) R X (G ((((p3 <= 0)) OR ((1 <= p24)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p44)) AND ((p42 <= 0))) R X (G ((((p3 <= 0)) OR ((1 <= p24)))))))
lola: processed formula length: 78
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1037 markings, 3939 edges
lola: ========================================
lola: subprocess 2 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p17)) AND ((p12 <= 0))))) AND F (((p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p7))
lola: processed formula length: 11
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p17)) AND ((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p17)) AND ((p12 <= 0)))))
lola: processed formula length: 39
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p39 <= 0)) OR ((1 <= p53))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p39 <= 0)) OR ((1 <= p53))))))
lola: processed formula length: 43
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 32 markings, 32 edges
lola: ========================================
lola: subprocess 4 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((((1 <= p1)) AND ((p19 <= 0)))) AND (F ((((p1 <= 0)) OR ((1 <= p7)))) OR (((1 <= p1)) AND ((p19 <= 0)))))) AND X (((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((((1 <= p1)) AND ((p19 <= 0)))) AND (F ((((p1 <= 0)) OR ((1 <= p7)))) OR (((1 <= p1)) AND ((p19 <= 0)))))) AND X (((p12 <= 0)))))
lola: processed formula length: 141
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 5 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((1 <= p3)) OR ((p1 <= 0)) OR ((1 <= p25)))) AND (X (X ((((p1 <= 0)) OR ((1 <= p25))))) OR F (((1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((1 <= p3)) OR ((p1 <= 0)) OR ((1 <= p25)))) AND (X (X ((((p1 <= 0)) OR ((1 <= p25))))) OR F (((1 <= p25))))))
lola: processed formula length: 121
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1065 markings, 3982 edges
lola: ========================================
lola: subprocess 6 will run for 3558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((((1 <= p24)) AND ((p33 <= 0))) R (((1 <= p1)) AND ((p33 <= 0)))) OR (((p39 <= 0)) OR ((1 <= p42))))) AND ((((1 <= p24)) AND ((p33 <= 0))) OR (((((1 <= p24)) AND ((p33 <= 0))) R (((1 <= p1)) AND ((p33 <= 0)))) OR (((p39 <= 0)) OR ((1 <= p42)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((((1 <= p24)) AND ((p33 <= 0))) R (((1 <= p1)) AND ((p33 <= 0)))) OR (((p39 <= 0)) OR ((1 <= p42))))) AND ((((1 <= p24)) AND ((p33 <= 0))) OR (((((1 <= p24)) AND ((p33 <= 0))) R (((1 <= p1)) AND ((p33 <= 0)))) OR (((p39 <= 0)) OR ((1 <= p42)))))))
lola: processed formula length: 256
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 48 markings, 51 edges
lola: RESULT
lola:
SUMMARY: yes no no no no no no
lola:
preliminary result: yes no no no no no no
lola: ========================================
lola: memory consumption: 28116 KB
lola: time consumption: 12 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
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="DiscoveryGPU-PT-06a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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-4028"
echo " Executing tool itslola"
echo " Input is DiscoveryGPU-PT-06a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882600585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06a.tgz
mv DiscoveryGPU-PT-06a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;